Find the remainder when 1 9 9 2 is divided by 9 2 .
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.
Its not an INMO problem. It appeared in the RMO.
Log in to reply
No, it's really an INMO 1992 question, but it's quite easy.
Using Euler's generalization of fermat's theorem
1 9 ϕ ( 9 2 ) ≡ 1 ( m o d 9 2 ) where ϕ ( n ) is Euler's phi function(or totient function)
9 2 = 2 3 × 2 2
⟹ ϕ ( 9 2 ) = 9 2 ( 1 − 2 1 ) ( 1 − 2 3 1 ) = 4 4
⟹ 1 9 4 4 ≡ 1 ( m o d 9 2 )
⟹ 1 9 ( 4 4 ) ⋅ 2 ≡ 1 2 ( m o d 9 2 )
⟹ 1 9 8 8 ≡ 1 ( m o d 9 2 )
Multiplying both sides by 1 9 4 yields
⟹ 1 9 9 2 ≡ 1 9 4 ( m o d 9 2 ) .. (1)
Now 1 9 2 ≡ 8 5 ( m o d 9 2 ) ≡ ( − 7 ) ( m o d 9 2 )
1 9 4 ≡ ( − 7 ) 2 ≡ 4 9 ( m o d 9 2 ) .. (2)
Using (1) and (2)
1 9 9 2 ≡ 4 9 ( m o d 9 2 )
Hence the answer is 4 9
Simple standard approach.
We can apply euler's function
Problem Loading...
Note Loading...
Set Loading...
I can't believe this is an INMO problem. It's actually quite easy if you do it by modulo function. 92=23x4 now, 19= -1(mod 4) 19^22=1 (mod 4) 19^22 = 1(mod 23) Therefore, 19^22=1 (mod 23x4) = 1(mod 92) so, 19^88= 1 (mod 92) therefore, 19^92=49 (mod 92)