Difference between revisions of "Mock AIME 5 2005-2006 Problems/Problem 10"
m (Created page with "== Problem == == Solution == == See also == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=9|num-a=11}} Category:Intermediate Number Theory Problems") |
m (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | |||
| + | 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 == | == Solution == | ||
such that 
is divisible by all the primes between 
and 
.
