Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (anonymous):

Let \[n \in Z ^{+}\] and let n = \[p _{1}^{k1} + p _{2}^{k2} + p _{3}^{k3} ..... + p _{n}^{kn}\] be its prime decomposition. How many divisors n has.

OpenStudy (anonymous):

How many divisors does n have?*

OpenStudy (ybarrap):

So this is NOT a product?

OpenStudy (anonymous):

I'm assuming not. Whatever n is equal to, the number of divisors of n have to be determined.

OpenStudy (anonymous):

\[p _{1}^{k1} + p _{2}^{k2} + p _{3}^{k3} ..... + p _{n}^{kn}\] is not a prime decomposition i don't think

OpenStudy (anonymous):

Oops, its actualy multiplication, not addition.

OpenStudy (ybarrap):

In that case, the number of divisors \(d\) with this factorization is $$ d(n) = (k_1 + 1) (k_2 + 1) \cdots (k_n + 1), $$

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!