What is the last 2 digits of 6 1 0 0 ?
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 we know n = 3 is the only value of n for which 2 5 n + 1 ≡ 0 ( m o d 4 ) ? Or is it?
Log in to reply
n = 3 is not the only value of n , but the smallest, any n = 4 k + 3 , where k = 0 , 1 , 2 . . . , works too, but the answer 7 6 still stands.
Powers of 6 , starting with 6 2 = 3 6 , have the two ending digits equal to 3 6 , 1 6 , 9 6 , 7 6 , 5 6 and this sequence of five possible endings repeats.
6 5 , and all powers of 6 divisible by 5 , which includes 6 1 0 0 , end in 7 6 .
Problem Loading...
Note Loading...
Set Loading...
Since 6 and 100 are not coprime integers. Let us consider the modulos of 6 1 0 0 of 4 and 25 ( 1 0 0 = 4 × 2 5 ) separately.
6 1 0 0 ≡ ( 3 6 ) 5 0 ≡ 0 (mod 4)
6 1 0 0 ≡ 6 1 0 0 mod ϕ ( 2 5 ) (mod 25) ≡ 6 1 0 0 mod 2 0 (mod 25) ≡ 6 0 (mod 25) ≡ 1 (mod 25) Since g cd ( 6 , 2 5 ) = 1 , Euler’s theorem applies. Euler’s totient function ϕ ( 2 5 ) = 2 0
Let 6 1 0 0 ≡ 2 5 n + 1
⟹ 2 5 n + 1 2 5 ( 3 ) + 1 ⟹ 6 1 0 0 ≡ 0 (mod 4) ≡ 7 6 ≡ 0 (mod 4) ≡ 7 6 (mod 100)