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.
Using F e r m a t l i t t l e t h e o r e m ,
a p − 1 = 1 m o d p , where p is a prime.
therefore, 2 2 2 2 6 ( 9 2 5 ) = 1 m o d 7 .
so, 2 2 2 2 5 5 5 5 m o d 7 = 2 2 2 2 5 m o d 7 = 5
Where did you get the 925?
Log in to reply
he just multiplied it to get closer to 5555, then there is a remaining 5 so he multiplied it again by 2222^5
There is a very simple algorithm you can follow to produce the remainder of a number following a division: (In this case)
step 1) divide by 7
step 2) subtract the integer part of the answer
step 3) Multiply by 7
Step 4) Celebrate :P
(2222)^(5555) = (7 X 317 + 3)^(6 X 925 + 5) =
(3)^(5) (mod 7) = 243 (mod 7) = (7 X 34 + 5) = 5 (mod 7)
powers of 2222 mod 7, cycles after an interval of 6 in the sequence 3,2,6,4,5,1....3,2,6,4,5,1.... and we know that 5555 mod 6= 5....... so 2222^5555 mod 6= the fifth term in the sequence, i.e, 5....
Fermat little a^p = mod ( p) & we have 3 ^ 6 = 1 mod (p) # ( 2222 ) ^ ( 5555 ) = 2222/ 7 = (317 * 7 + 3 ) ^ 5555 = 3^ 5555 = 3 ^ ( 6) (925) * (3) ^ ( 5 ) = ( 3 ) ^ ( 5 ) = 5 mod ( 7)
Problem Loading...
Note Loading...
Set Loading...
By Fermat we have 3 6 ≡ 1 ( m o d 7 ) so 2 2 2 2 5 5 5 5 = ( 3 1 7 × 7 + 3 ) 5 5 5 5 ≡ 3 5 5 5 5 = 3 6 × 9 2 5 + 5 = ( 3 6 ) 9 2 5 3 5 ≡ 3 5 ≡ 5 ( m o d 7 )