Help Needed: Solving 2007^2007^2007^2007 Last 3 Digits

  • Thread starter Thread starter AraProdieur
  • Start date Start date
  • Tags Tags
    Assistance
AraProdieur
Messages
27
Reaction score
0
What are the last three digits of 2007^2007^2007^2007?

So far, I have tried doing it one by one to see if there was a pattern in the units, but haven't had much luck.

Any help?
 
Physics news on Phys.org
Perhaps think of it in a different manner: what is the remainder of 2007^n when divided by 1000 ?
 
This is a pretty tricky problem in modular arithemetic. Here's a simpler problem of the same sort: what is the remainder when 2^1000 is divided by 13 ?

Solution: notice that 64 = -1 mod 13, since 5*13 = 65. Also, 64 is a power of 2: 2^6 = 64. Then, 1000 = 6*166 + 4, so 2^1000 = (2^6)^166 * 2^4 = 64^166 * 2^4. Then, 2^1000 mod 13 = (64^166 mod 13)*(2^4 mod 13) = (64 mod 13)^166 * (16 mod 13) = (-1)^166 * 3 = 3. So the answer is 3.

Your problem is considerably more difficult.
 
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