The product of the first 1 0 0 0 positive even integers differs from the product of the first 1 0 0 0 odd integers by a multiple of
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.
We can find the divisibility of this difference by m o d function.
( 2 × 4 × 6 × . . . . . . . . × 1 9 9 8 × 2 0 0 0 ) − ( 1 × 3 × 5 × . . . . . . . . × 1 9 9 7 × 1 9 9 9 ) m o d 1 9 9 7 = 7 6 1 (Not divisible)
( 2 × 4 × 6 × . . . . . . . . × 1 9 9 8 × 2 0 0 0 ) − ( 1 × 3 × 5 × . . . . . . . . × 1 9 9 7 × 1 9 9 9 ) m o d 1 9 9 9 = 1 (Not divisible)
( 2 × 4 × 6 × . . . . . . . . × 1 9 9 8 × 2 0 0 0 ) − ( 1 × 3 × 5 × . . . . . . . . × 1 9 9 7 × 1 9 9 9 ) m o d 2 0 0 3 = 1 0 0 0 (Not divisible)
( 2 × 4 × 6 × . . . . . . . . × 1 9 9 8 × 2 0 0 0 ) − ( 1 × 3 × 5 × . . . . . . . . × 1 9 9 7 × 1 9 9 9 ) m o d 2 0 0 1 = 0 (Divisible)
Thus, the answer is 2 0 0 1
can u please explain this mod function in detail
nice solution....I used the same process..
Problem Loading...
Note Loading...
Set Loading...
We can write the difference between the first 1000 positive even numbers and the first 1000 positive odd numbers as: 2 × 4 × . . . × 2 0 0 0 − ( 2 0 0 1 − 2 0 0 0 ) ( 2 0 0 1 − 1 9 9 8 ) . . . ( 2 0 0 1 − 2 ) All of the terms from the expansion of the brackets are divisible by 2001 except for 2 0 0 0 × 1 9 9 8 × . . . × 2 , which is just the product of the first 1000 even numbers. Therefore this term is cancelled out, meaning every term is now divisble by 2001, so the whole thing is divisible by 2 0 0 1