Only numbers!

Determine the largest 3 digit prime factor of ( 2000 1000 ) \binom{2000}{1000} ,

where ( n r ) = n ! r ! × ( n r ) ! \binom{n}{r}=\dfrac{n!}{r! \times (n-r)!} .


The answer is 661.

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

Chew-Seong Cheong
Aug 18, 2015

( 2000 1000 ) = 2000 × 1999 × 1998 × . . . × 1001 1 × 2 × 3 × . . . × 1000 \begin{pmatrix} 2000 \\ 1000 \end{pmatrix} = \dfrac{2000 \times 1999 \times 1998 \times ... \times 1001}{1 \times 2 \times 3 \times ... \times 1000}

All the divisors including the primes are cancelled out. The 3-digit primes in the nominator not cancelled out are those < 2000 ÷ 3 < 2000 \div 3 and the largest of which is 661 \boxed{661} .

Did the same way sir .

Mukul Sharma - 5 years, 10 months ago

Sir I can't understand ,why are you devide 2000 by 3

Soumen Nandi - 5 years, 9 months ago

Log in to reply

Sorry, I should mention the 3-digit primes remaining. All the 3-digit primes appear once in the denominator. They can appear once to 10 times in the nominator. For example, 991 991 appears only once as 1982 = 991 × 2 1982 = 991\times 2 , but 101 101 appears 10 times 1010 , 1111 , 1212 , . . . , 1919 1010, 1111, 1212, ...,1919 . Since all the 3-digit primes appear once in the nominator are cancelled by those in the denominator, what remain are those appear more than once in the nominator, and the larger ones appear twice. Generally the 3-digit primes that appear once in the nominator are > 2000 ÷ 3 > 2000 \div 3 and the 3-digit primes that appear more than once are < 2000 ÷ 3 <2000 \div 3 .

Chew-Seong Cheong - 5 years, 9 months ago
Priyanshu Mishra
Sep 26, 2015

If p p is a prime such that 666 < p < 1000 666\quad <\quad p\quad <\quad 1000 , then the only numbers 2000 \le 2000 , which are divisible by
p p are p p and 2 p 2p . Therefore the highest power of p p which divides 2000 ! 2000! is p 2 { p }^{ 2 } . Obviously, the highest power of p p dividing 1000 ! 1000! is p p itself.

Since ( 2000 1000 ) {2000 \choose 1000} = 2000 ! ( 1000 ! ) 2 \frac { 2000! }{ { (1000!) }^{ 2 } } , p p does not divide
( 2000 1000 ) {2000 \choose 1000} .

So let p p be the largest prime less than 666 666 , viz., 661 661 .

It is obvious that the highest powers of p p which divide 2000 ! 2000! and ( 1000 ! ) 2 ({ 1000!) }^{ 2 } are p 3 { p }^{ 3 } and p 2 { p }^{ 2 } respectively; therefore p p divides ( 2000 1000 ) {2000 \choose 1000} .

So. answer : 661 \boxed{661} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...