Not clear with last part of solution of problem NUMBER OF DIVISORS

#1

In solution count of divisor of each number is calculated and then you took product of that count like this:
count*=(freqOfPrimeFact[i]+1);
I want to know how we get total number of divisors by taking product of count of divisors and each number ?
why you have added 1 to frequency of divisor before taking product?

#2

Hi

This is based on Permutation and combination

for example number n=135070

prime factorization of it will be : 13552752 or 13*(5^3)*(2^2)*7

now let us look at a divisor of this number, any number that is combination of prime of above prime numbers will be a divisor,

so we have 2 ways for 13( choose it or not)
4 ways for 5 ( choose 1,2 ,3 or don’t choose it)
similarly
for others also

so total number of divisor will be 243*2=48

for more explanation contact me on 8750354215

Hit like if you get it!
Cheers!

#3

Hi
@spock73 if your doubt is resolved please mark it resolved in your course.

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.