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.
We can solve this (and other questions like it) using a combination of the Chinese Remainder Theorem and Euler's Theorem.
First of all, Euler: if a and n are coprime, then a φ ( n ) ≡ 1 ( m o d n ) , where φ ( n ) is the Euler Totient function.
In this case, we have φ ( 1 0 0 ) = 4 0 ; so by the theorem, we have
3 3 8 5 ≡ ( 3 4 0 ) 9 ⋅ 3 2 5 ≡ 3 2 5 ( m o d 1 0 0 )
It's absolutely possible to finish here and just work out the powers needed, but sometimes it's useful to use the Chinese Remainder Theorem as well.
We have 1 0 0 = 4 ⋅ 2 5 .
3 2 5 ≡ ( − 1 ) 2 5 ≡ 3 ( m o d 4 )
and, using Euler again (and that φ ( 2 5 ) = 2 0 ),
3 2 5 ≡ 3 5 = 2 4 3 ≡ 1 8 ( m o d 2 5 )
The Chinese Remainder Theorem tells us that there is a unique solution to both of these congruences modulo 1 0 0 . The quickest way to solve these is to combine them; the second one tells us that 3 3 8 5 = 1 8 + 2 5 k for some k ; looking at this modulo 4 we have 3 3 8 5 ≡ 2 + k ≡ 3 so that k ≡ 1 ( m o d 4 ) ; this gives the answer 1 8 + 2 5 = 4 3 with tens digit 4 .