Find the last two digits of:
2 5 5 0 digits 2 5 2 5 2 5 … 2 5
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.
How do you get 2 5 1 = 7 6 ? :)
Log in to reply
Ha! I knew I would miss something from my copying and pasting :-) I fixed it.
The number 2 5 is automorphic that is its powers 2 5 n always end with itself. That is 2 5 n ≡ 2 5 (mod 100) . We can prove this using Chinese remainder theorem as follows:
2 5 n ≡ ( 2 4 + 1 ) n ≡ 1 n ≡ 1 (mod 4) and 2 5 n ≡ 0 (mod 25) . Therefore, 2 5 n = 2 5 m , where m is an integer. Then 2 5 m ≡ 1 (mod 4) ⟹ m ≡ 1 ⟹ 2 5 n ≡ 2 5 (mod 100) .
Quick explanation 1 sentence
5 to the power of any integer that is bigger than 2 ends in 25 so 25 to the power of any integer will end in 25
25 has a two-digit power cycle of 1. That means 2 5 1 , 2 5 2 , 2 5 3 … 2 5 k all end with the last two digits as 25. So regardless of the exponent in 25, it will end with the last two digits as 2 5
Problem Loading...
Note Loading...
Set Loading...
From 2 5 1 = 2 5 , 2 5 2 = 6 2 5 , and 2 5 3 = 1 5 6 2 5 , it would appear that the last two digits 2 5 n are 2 5 for any positive integer n .
This can be proved inductively:
Therefore, the last two digits of the given number are 2 5 .
Bonus: 2 5 is another automorphic number .