Difference between revisions of "Mock AIME 5 2005-2006 Problems/Problem 10"
m (→Problem) |
(→Solution) |
||
| Line 2: | Line 2: | ||
Find the smallest positive integer <math>n</math> such that <math>{2n \choose n}</math> is divisible by all the primes between <math>10</math> and <math>30</math>. | Find the smallest positive integer <math>n</math> such that <math>{2n \choose n}</math> is divisible by all the primes between <math>10</math> and <math>30</math>. | ||
| − | |||
| − | |||
== Solution == | == Solution == | ||
such that 
is divisible by all the primes between 
and 
.
