Is there a theorem that describes how many prime factors a number has? And does this this theorem have a solution on how to find them?

No vote yet

2 votes

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestYou can review Divisors of an Integer. – Calvin Lin Staff · 4 years, 3 months ago

Log in to reply

If a number \(N= p_{1}^{a_{1}}p_{2}^{a_{2}}\cdots p_{m}^{a_{m}} \), for primes \(p_{1},p_{2}\cdots p_{m}\) and natural numbers \(a_{1},a_{2}\cdots a_{m}\), then the number of factors that \(N\) has is denoted by \(d(N)\) and is given by the formulae: \(d(N)= (a_{1}+1) (a_{2}+1)\cdots (a_{m}+1)\).

And the proof is combinatoric. If \(S= p_{1}^{b_{1}}p_{2}^{b_{2}}\cdots p_{m}^{b_{m}}\) is a factor of \(N\) , where \(b_{1},b_{2}\cdots b_{m}\) are natural, then each \(b_{i} \leq a_{i}\) for all indices \(i\). So ecah \(b_{i}\) can be chosen in \((a_{i}+1)\) ways, so the total number of such \(S\) is \(d(n)\). – Shourya Pandey · 4 years, 3 months ago

Log in to reply

– Gabriel Kong · 4 years, 3 months ago

Thanks a lot! :DLog in to reply

What shourya pointed out was the number FACTORS of a number, not the number of PRIME factors. – Harrison Lian · 4 years, 3 months ago

Log in to reply

http://en.wikipedia.org/wiki/Divisor_function and http://mathworld.wolfram.com/Divisor.html – Lab Bhattacharjee · 4 years, 3 months ago

Log in to reply

– Gabriel Kong · 4 years, 3 months ago

wow! thanks.Log in to reply