RMO 2001 ; Part - 2

The product of the first 1000 1000 positive even integers differs from the product of the first 1000 1000 odd integers by a multiple of

2003 2001 1997 1999

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.

2 solutions

Josh Rowley
Apr 12, 2014

We can write the difference between the first 1000 positive even numbers and the first 1000 positive odd numbers as: 2 × 4 × . . . × 2000 ( 2001 2000 ) ( 2001 1998 ) . . . ( 2001 2 ) 2\times4\times...\times2000 - (2001-2000)(2001-1998)...(2001-2) All of the terms from the expansion of the brackets are divisible by 2001 except for 2000 × 1998 × . . . × 2 2000\times1998\times...\times2 , 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 2001 \fbox{2001}

Saurabh Mallik
Apr 17, 2014

We can find the divisibility of this difference by m o d mod function.

( 2 × 4 × 6 × . . . . . . . . × 1998 × 2000 ) ( 1 × 3 × 5 × . . . . . . . . × 1997 × 1999 ) m o d (2 \times 4 \times 6 \times ........\times 1998 \times 2000) - (1 \times 3 \times 5 \times ........\times 1997 \times 1999) mod 1997 = 761 1997 = 761 (Not divisible)

( 2 × 4 × 6 × . . . . . . . . × 1998 × 2000 ) ( 1 × 3 × 5 × . . . . . . . . × 1997 × 1999 ) m o d (2 \times 4 \times 6 \times ........\times 1998 \times 2000) - (1 \times 3 \times 5 \times ........\times 1997 \times 1999) mod 1999 = 1 1999 = 1 (Not divisible)

( 2 × 4 × 6 × . . . . . . . . × 1998 × 2000 ) ( 1 × 3 × 5 × . . . . . . . . × 1997 × 1999 ) m o d (2 \times 4 \times 6 \times ........\times 1998 \times 2000) - (1 \times 3 \times 5 \times ........\times 1997 \times 1999) mod 2003 = 1000 2003 = 1000 (Not divisible)

( 2 × 4 × 6 × . . . . . . . . × 1998 × 2000 ) ( 1 × 3 × 5 × . . . . . . . . × 1997 × 1999 ) m o d (2 \times 4 \times 6 \times ........\times 1998 \times 2000) - (1 \times 3 \times 5 \times ........\times 1997 \times 1999) mod 2001 = 0 2001 = 0 (Divisible)

Thus, the answer is 2001 \boxed{2001}

can u please explain this mod function in detail

Saurav Sharma - 7 years, 1 month ago

nice solution....I used the same process..

Rishi Evans - 7 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...