The remainder when 4 5 6 6 1 0 2 1 is divided by 23 can be expressed in the form a a . Find 1 0 0 a .
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.
Maybe there is no need for such hard calculations......
How have you written this line .Please explain 4 5 6 6 9 \equiv\(2^{9} . 3 9 . 7 6 1 9 ) (mod 23)
I just guess, a^a<23 so a is 1 or 2
Cool. ..................
Exactly what I did!
same here....
I did that and tried first with 2 :P
a^a cannot be bigger than 23.
a a < 23. So either 1 or 2.
Problem Loading...
Note Loading...
Set Loading...
Well I will go for an explicit solution...
We know that according to fermat's little remainder theorem:
a p − 1 ≡ 1 (mod p)
4 5 6 6 2 2 ≡ 1 (mod 23)
4 5 6 6 2 2 ( 4 6 ) ≡ 1 (mod 23)
4 5 6 6 1 0 1 2 ≡ 1 (mod 23)
Now we have 4 5 6 6 9 remaining with us...
4566= 2 × 3 × 7 6 1
761 ≡ 2 (mod 23)
4 5 6 6 9 \equiv\(2^{9} . 3 9 . 7 6 1 9 ) (mod 23)
4 5 6 6 9 \equiv\(2^{9} . 3 9 . 2 9 ) (mod 23)
4 5 6 6 9 \equiv\(12^{9} ) (mod 23)
thus we need to find y where
1 2 9 ≡ y (mod23)
12 ≡ 1 2 (mod23)
1 2 2 ≡ 6 (mod23)
1 2 3 ≡ 3 (mod23)
1 2 3 X 1 2 3 X 1 2 3 ≡ 3 X 3 X 3 (mod23)
= 1 2 9 ≡ 2 7 (mod23)
= 1 2 9 ≡ 4 (mod23)
Therefore,
4 5 6 6 1 0 2 1 ≡ 4 (mod23)
4 = 2 2
Implies that a=2
therefore, 100a= 2 0 0