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

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

OpenStudy (perl):

i take that back, this is a choosing problem

OpenStudy (perl):

for each of the k1 powers you can have k2 powers , etc so it is k1 * k2 * k3* ... kn

OpenStudy (zarkon):

not quite

OpenStudy (perl):

lets do an example 3^2 * 5^3

OpenStudy (perl):

right, i need to add one

OpenStudy (zarkon):

correct

OpenStudy (perl):

the possibilities are for powers are 1,0 1,1 1,2 1,3 2,0 2,1 2,2 2,3 so we have 2 * (3+1)

OpenStudy (perl):

for 3^2 * 5^3

OpenStudy (zarkon):

0,0 is a possibility

OpenStudy (perl):

thats a trivial divisor

OpenStudy (zarkon):

still a divisor

OpenStudy (perl):

ok,

OpenStudy (zarkon):

0,0 0,1 0,2 0,3

OpenStudy (perl):

right, just about to write that

OpenStudy (perl):

so we have (2+1)(3+1). and generalizing this we have (k1+1)(k2+1)...(kn+1) divisors

OpenStudy (zarkon):

correct...\[\prod_{i=1}^{n}(k_i+1)\]

OpenStudy (perl):

yes :)

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!