Skip to main content

Generate the number of divisors of a given number using matlab functions method 2

Please note that the method 1 is slower than the method 2 for large numbers. See the explanation section to know why this is happening.

Problem

Write a function in matlab to generate the number of divisors of a given number. For example if the input is 28 then the value should be 6.

Solution

To understand this program you have to first understand the mathematics behind using the for loop till the square root of the number. For this let us consider the number 28. I will start writing this number from 1.
28 = 1x28 = 2x14 = 4x7

So the divisors are 1,2,4,7,14,28 and they can be written in pairs as (1,28),(2,14),(4,7) or if we will divide the number less than its square root then we will get all the divisors. So if a number below the square root divides the number(28) then it will correspond to an another number (for example the number 28 is divisible by 1 and thus it also corresponds to its pair value 28 and similarly 2 for 14, and 4 for 7). So twice total number of divisors less than the square root of the number will give the total number of divisors. Please try with more numbers to get a better understanding. If you still didn't understand properly then check the 1st link in the references section.

In this program I have used for loop, rem function, and if statement.If you don't know these then learn from here: For loop in Matlab
Find the explanation for the program below the program section.

Program


function counter = numberofdivisors2(n)
%This function will generate the number of divisors for a given number n

counter = 0;
for i = 1:int32(sqrt(n))
    if rem(n,i) == 0
        counter = counter+1;
    end
end
counter = counter*2;

Download the above program in matlab file format from here: numberofdivisors2.m

Explanation

This program is very simple to understand if you have understood the above solution section. Here we will know how the program works accordingly. We will consider the input of the funciton is 28 or we have called numberofdivisors2(28).
Let us see this program by following the iterations

First iteration

During the first iteration, the value of i is 1 and the if statement is true and the counter value will be added by 1.

Second iteration

During the second iteration, the value of i is 2 and the if statement is true and the counter value changes from counter = counter+1=1+1 = 2. and the second iteration comes to halt, now the third iteration starts

Third iteration

In the third iteration everything goes same but the if statement is not executed and thus the counter value doesn't change.

Fourth Iteration

Here the value of i is 4 and the if statement is true and the value of counter changes from counter = counter+1 = 2+1 = 3

Fifth Iteration - Final iteration

In this iteration, the value of i is 5 and the if statement is not true and thus this ends up. With the fifth iteration the for loop stops because we only have used till the square root of the number.

Finally in the program the counter is multiplied by 2 to give the correct number of divisors. Remember that this program till for loop will only give half of the number of divisors. So we have multiplied it by 2 to give the correct answer.

This program has been high lighted using hilite.me

References

2) http://www.mathblog.dk/triangle-number-with-more-than-500-divisors/

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

 Keywords: number of divisors, matlab functions
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 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...
Read more

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