P, q, and r are prime #'s and a, b, and c are positve intgers, how many divisors

  • Thread starter Thread starter mr_coffee
  • Start date Start date
  • Tags Tags
    Prime
mr_coffee
Messages
1,613
Reaction score
1
Hello everyone.

I think i got this right but i want to make sure...
If p, q and r are prime numbers and a, b, and c are positive integers, how many possible divisors does p^a*p^b*r^c have?

I said...
There are a+1 divisors: 1, p, p^2...,p^a
A divisor is a product of anyone of the a+1 numbers listed above times anyone of the b+1 numbers 1, q, q^2...q^b. We also have r+1...1, r, r^2...,r^c so by the muliplication rule, there are (a+1)(b+1)(r+1) divisors in all.
 
Physics news on Phys.org
Yes, that looks good, except for one part. The answer should be (a+1)(b+1)(c+1). You wrote (r+1) instead of (c+1), but I think this was just a typo.
 
ahh yes! thanks for picking that up, it was a typo.
Thanks for the responce.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top