2 0 1 5 2 × 2 0 1 3 6 × 2 0 1 1 1 0 × . . . × 5 4 0 2 2 × 3 4 0 2 6 × 1 4 0 3 0
What is the remainder if the expression above is divided by 7?
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.
Yes, that's one way to solve without resorting to Fermat's little theorem. For the sake of variety, can you solve this via Fermat's little theorem?
Same method :)
If we use Fermat's little theorem, we get (a weaker result) that 2 6 ≡ 1 ( mod 7 ) and hence 2 1 0 0 8 = ( 2 6 ) 1 6 8 ≡ 1 ( mod 7 ) .
hey guys, how can i learn mod? i never know it until i'm a brilliant member. thx
Problem Loading...
Note Loading...
Set Loading...
We can rearrange to find:
2 0 1 5 2 × 2 0 1 3 6 × 2 0 1 1 1 0 × … × 5 4 0 2 2 × 3 4 0 2 6 × 1 4 0 3 0
= 1 2 × 3 6 × 5 1 0 × … × 2 0 1 1 4 0 2 2 × 2 0 1 3 4 0 2 6 × 2 0 1 5 4 0 3 0
= 2 2 2 0 1 6 = 2 1 0 0 8 .
Since 2 3 = 8 ≡ 1 ( mod 7 ) , we get 2 1 0 0 8 = ( 2 3 ) 3 3 6 ≡ 1 ( mod 7 ) .