1 × 2 2 × 3 3 × ⋯ × 1 0 0 1 0 0
If the expression above is divided by 101, the remainder will be less than 50. Find this remainder.
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.
Is there any reason for taking R=-a since taking R=a , would be much simpler ?
Log in to reply
As R = − 5 0 ! and ( 5 0 ! ) 2 ≡ 1 0 0 , if a = 5 0 ! , then R = − a .
Of course, a 2 ≡ 1 0 0 ⇔ ( − a ) 2 ≡ 1 0 0 , so we also have R 2 ≡ 1 0 0 . If we see this at once, we can just skip a alltogether and do with this much simpler way:
R ≡ − 5 0 ! ⇒ R 2 ≡ ( − 5 0 ! ) 2 ≡ ( 5 0 ! ) 2 ≡ 1 0 0
ok ok ... a is 50! .now i understand . @Laurent Shorts you can clearly state the variables so that we could understand faster . The solution is awesome ! :) thank you
Problem Loading...
Note Loading...
Set Loading...
Modulus 101: 1 1 × 2 2 × ⋯ × 9 9 9 9 × 1 0 0 1 0 0 ≡ 1 1 × 2 2 × ⋯ × 5 0 5 0 × ( − 5 0 ) 5 1 × ( − 4 9 ) 5 2 ⋯ × ( − 1 ) 1 0 0
≡ ( − 1 ) 2 5 ⋅ ( 5 0 ! ) 1 0 1 ≡ − 5 0 ! by Fermat's little theorem .
( 5 0 ! ) 2 ≡ 1 × 2 × ⋯ 5 0 × 5 0 × 4 9 × ⋯ × 1 ≡ 1 × 2 × ⋯ × 5 0 × ( − 5 1 ) × ( − 5 2 ) × ⋯ × ( − 1 0 0 )
≡ 1 0 0 ! ≡ − 1 ≡ 1 0 0 by Wilson's theorem .
The answer is R = − a where a 2 ≡ 1 0 0 ↔ R 2 ≡ 1 0 0 . As 101 is prime, there are only two possibilities and we can see that R ≡ 1 0 or R ≡ − 1 0 ≡ 9 1 > 5 0 . The answer must be 1 0 .