Find the last five digits of 5 1 2 3 4 5 7 1 .
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.
I am 0 with Mods
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?
Simply used Euler's Theorem.
To calculate last 5 digits we need to find the remainder by 100000.
So first we cancel 5 5 .
Now we need to find the remainder when 5 1 2 3 4 5 6 6 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 × 3 1 2 5 = 2 8 1 2 5 .
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 3 1 2 5 ) and N ≡ 9 ( m o d 3 2 ) , hence we get that N ≡ 2 8 1 2 5 ( m o d 3 2 ) .
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 3 1 2 5 ) and N ≡ 9 ( m o d 3 2 ) , hence we get that N ≡ 2 8 1 2 5 ( m o d 3 2 ) .
First calculate 5 1 2 3 4 5 6 6 ( m o d 3 2 ) . We get it to be 9. Then multiply 3125 to get the desired result.
Problem Loading...
Note Loading...
Set Loading...
Using the Carmichael function, we find that 5 8 ≡ 1 ( m o d 3 2 ) . Thus 5 1 2 3 4 5 6 6 = 5 8 × 1 5 4 3 2 0 + 6 ≡ 5 6 ≡ 9 ( m o d 2 5 ) . Multiplying through with 5 5 we find that 5 1 2 3 4 5 7 1 ≡ 9 × 5 5 = 2 8 1 2 5 ( m o d 1 0 5 )