Skip to main content

Find the power of each factor in a given number using matlab function

Problem

Write a function in matlab to find the exponent of each prime factor of a given number. For example if the input is 28 then the output should be


Power of 2 in the number 28 is 2
Power of 3 in the number 28 is 0
Power of 5 in the number 28 is 0
Power of 7 in the number 28 is 1

Solution

The solution is simple and one has to know the function definition, factor function, for loop, nnz function, isprime function, and the if statement to understand the program. Don't worry if you don't know the function definition. You can even program this code without a function. The difference will be that there will not be a function definition line, and the value of n is directly defined instead. But it would be useful if you know them. If you want to learn any of the above then head on to the links below.

Find the explanation for the program below the program

Program


function ret = countfacpowers(n)
%this function will calculate the exponent of each prime factor and return
%the result as a printed statement

vec = factor(n);
highest = vec(length(vec));

for i = 1:highest
    if isprime(i) == 1
        fprintf('Power of %d in the number %d is %d\n',i,n,nnz(vec == i));
    end
end
To get the matlab for the above code click here: countfacpowers.m

Explanation

During the starting of the function a vector is created to store the prime factors of the given numbers using the factor function. Now digging deep a highest variable is created in order to store the largest prime factor of the number. Here you can also use the max function but not to complicate this program more for the novice programmers, I just have used the last number of the vector which is the largest prime factor. Now let us understand the for loop iteration by iteration. I am considering the input number as 28 for this example

First iteration

During the first iteration the value of i is 1 and this doesn't qualify the if statement and doesn't execute. Thus first iteration is over and the second iteration starts

Second iteration

During the second iteration the value of i is changed from 1 to 2 and the value of 2 qualifies the if statement and the fprintf statement gets executed. Here we will understand what is happening in the nnz function. The nnz function in general gives the number of non zero elements in the vector. But here we have given the input to the nnz function as the vector whose values are 1 only where the value becomes equal to i. Let us simplify this:
First the value of the vec is [2 2 7]
Now we will call vec == 2 and this will give the output as [1 1 0] , 1 will only be created at the places where there is 2(Here in this case 2 and where there is i in general). Finally nnz([1 1 0]) will give 2 i.e. 1+1 = 2.
and the second iteration comes to halt

Similarly all the other iterations continue until the i value changes to 7.

I have tried to explain this program as easy as possible, but if you don't understand then please do contact me so that many others will get benefited 

The above code was highlighted using hilite.me

To read the above post in pdf format then you can do so by downloading from here: countfacpowers.pdf

Popular posts from this blog

Project Euler Problem 67 Solution with Python

Maximum path sum II By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.

Problem 43 Project Euler Solution with python

Sub-string divisibility The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property. Let d 1 be the 1 st digit, d 2 be the 2 nd digit, and so on. In this way, we note the following: d 2 d 3 d 4 =406 is divisible by 2 d 3 d 4 d 5 =063 is divisible by 3 d 4 d 5 d 6 =635 is divisible by 5 d 5 d 6 d 7 =357 is divisible by 7 d 6 d 7 d 8 =572 is divisible by 11 d 7 d 8 d 9 =728 is divisible by 13 d 8 d 9 d 10 =289 is divisible by 17 Find the sum of all 0 to 9 pandigital numbers with this property. One might write a simple solution using direct if else statements for this problem. Using if else statements, the execution time may be a few seconds. But this is not a very good approach. I too had written a program with if else statement which will take each and every permutation of the 0-9 Pandigital and check for the conditions given in the qu...

Add/Embed SVG to Blogger website

In this post I will tell you my method(trick) of adding SVG images in a blogger website or blog. Before starting , the first thin g I am assu m ing is that you are aware of SVG if you are here. If not please see S calable V ec tor G raphics Recently when I tried to embed a SVG image for a post on pygal, I tried uploading the SVG file and blogger Image uploader came up with an error, because of which I had to find some other way.  SVG File upload Error in Blogger  I started sea rc hing Google " Embed SVG in Blogger " . I found blogorrhea , w h ich gave some i nformatio n on add ing SVG directly as a markup , which worked , but I faced another problem using this . Also th is guy has used lot of Javascript which was confusin g for me, being new to using SVG.   So I first t houg ht of learning on h ow to embed SVG in HTML and t his on e worked out. Actually we can embed SVG in HTML i n following ways: Using Object tag Using Iframe tag Using embed...