Mock AIME 5 2005-2006 Problems/Problem 10

Revision as of 20:19, 8 October 2014 by Timneh (talk | contribs) (Problem)

Problem

Find the smallest positive integer $n$ such that ${2n \choose n}$ is divisible by all the primes between $10$ and $30$.

Solution

Solution

See also

Mock AIME 5 2005-2006 (Problems, Source)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15