So many 5s but

Find the last five digits of 5 1234571 \large 5^{1234571} .


The answer is 28125.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

4 solutions

Otto Bretscher
Sep 1, 2015

Using the Carmichael function, we find that 5 8 1 ( m o d 32 ) 5^8\equiv{1}\pmod{32} . Thus 5 1234566 = 5 8 × 154320 + 6 5 6 9 ( m o d 2 5 ) 5^{1234566}=5^{8\times{154320+6}}\equiv5^6\equiv9\pmod{2^5} . Multiplying through with 5 5 5^5 we find that 5 1234571 9 × 5 5 = 28125 ( m o d 1 0 5 ) 5^{1234571}\equiv9\times5^5=28125\pmod{10^5}

I am 0 with Mods

Syed Baqir - 5 years, 9 months ago
Chinmayee Behera
Sep 1, 2015

5^{4}=0625 : 5^{5}=3125 :5^{6}=..5625: 5^{7}=..8125: 5^{8}=..0625: 5^{9}=..3125

.................. :5^{1234568}=....0625

5^{1234569}=...3125:5^{1234570}=...5625 : 5^{1234571}=....8125

5^{7}=..78125 : 5^{11}=..28125 : 5^{15}=..78125 : 5^{19}=..28125 ........... :

5^{1234567}=....78125 : 5^{1234571}=...28125

Modular Ahrimethic?

Adam Phúc Nguyễn - 5 years, 9 months ago
Ankit Kumar Jain
Sep 4, 2015

Simply used Euler's Theorem.

To calculate last 5 digits we need to find the remainder by 100000.

So first we cancel 5 5 5^{5} .

Now we need to find the remainder when 5 1234566 5^{1234566} is divided by 32 . By applying Euler's Theorem we obtain remainder = 9.

Since we had cancelled out 3125, so we need to multiply it back. THIS gives the answer 9 × 3125 = 28125 9\times{3125} = 28125 .

Moderator note:

You have to be careful with what you mean by "since we cancelled 3125, we have to multiply it back". Division in modular arithmetic can be tricky.

What you should say is that "By the Chinese Remainder theorem, since N 0 ( m o d 3125 ) N \equiv 0 \pmod{3125} and N 9 ( m o d 32 ) N \equiv 9 \pmod{32} , hence we get that N 28125 ( m o d 32 ) N \equiv 28125 \pmod{32} .

You have to be careful with what you mean by "since we cancelled 3125, we have to multiply it back". Division in modular arithmetic can be tricky.

What you should say is that "By the Chinese Remainder theorem, since N 0 ( m o d 3125 ) N \equiv 0 \pmod{3125} and N 9 ( m o d 32 ) N \equiv 9 \pmod{32} , hence we get that N 28125 ( m o d 32 ) N \equiv 28125 \pmod{32} .

Calvin Lin Staff - 5 years, 9 months ago
Priyanshu Mishra
Oct 12, 2015

First calculate 5 1234566 5^{1234566} ( m o d 32 ) (mod 32) . We get it to be 9. Then multiply 3125 to get the desired result.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...