Skip to main content

Generate the number of divisors of a given number using matlab function method 3

Program

Write a function in matlab to generate the number of divisors of a given number using matlab?

Solution

To find the number of divisors of a given number, the mathematics is to find the powers of all the prime numbers and then apply this formula.
If a number n can be written as p1q1xp2q2xp3q3......
then number of divisors of the number is
(q1+1)(q2+1)(q3+1)+..........
Here we will modify the previously defined function: Function to find the exponent of each prime factor of a given number in Matlab. to get our result.

Program


function divisors = numberofdivisors3(n)
%this function will calculate the number of divisors of the number

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

for i = 1:highest
    if isprime(i) == 1
        divisors = divisors*(nnz(vec == i)+1);
    end
end
To download this program in matlab file format click here: numberofdivisors3.m

Explanation

The explanation is same as that of the post which we have previously created. Click here to go to the post : Function to find the exponent of each prime factor of a given number in Matlab. I will write the values of the iterations to make it easy for you to understand the changes.

First iteration

i = 1
divisors = 1

Second iteration

i = 2
divisors = 3

Third iteration

i = 3
divisors = 3
And this situation continues. If you didn't understand this one then please go to the post and read the explanation and you will understand everything here

Please let me know if you have doubt or question. You can contact me here: contact me
References:
1) http://mathschallenge.net/library/number/number_of_divisors
2) http://code.jasonbhill.com/sage/project-euler-problem-12/

Run the program and comment below the output you are getting for a given input.

 Keywords: number of divisors, matlab function
Labels:

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.
Read more

Problem 60 Project Euler Solution with python

Prime pair sets The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property. Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime. This problem is j u st a brute force problem. If you have come here because you don't know the limit upto which you will h ave to gener ate the prime numbers t hen go ahe ad and t r y with 10,000 . When I first start ed solving the problem I chose 1 million(beca use most of the problem s on project E uler have this limit ), but it took very long for the computer to fin d the solution. After searching on the internet then I found many people choosing 10, 000 so I have changed my in put f rom 1 million to 10000 and the output was f ast. He...
Read more

Project Euler Problem 66 Solution with python

Diophantine equation ¶ Consider quadratic Diophantine equations of the form: $$ x^{2} – Dy^{2} = 1 $$ For example, when $D = 13$, the minimal solution in $ x $ is $ 649^{2} – 13 \times 180^{2} = 1 $ It can be assumed that there are no solutions in positive integers when $ D $ is square. By finding minimal solutions in $ x $ for $ D = {2, 3, 5, 6, 7} $, we obtain the following: $$ 3^{2} – 2×2^{2} = 1 $$ $$ 2^{2} – 3×1^{2} = 1 $$ $$ 9^{2} – 5×4^{2} = 1 $$ $$ 5^{2} – 6×2^{2} = 1 $$ $$ 8^{2} – 7×3^{2} = 1 $$ Hence, by considering minimal solutions in $ x $ for $ D ≤ 7 $, the largest $ x $ is obtained when $ D = 5 $. Find the value of $ D ≤ 1000 $ in minimal solutions of $ x $ for which the largest value of $ x $ is obtained.
Read more