Mock AIME 5 2005-2006 Problems/Problem 10

Revision as of 13:15, 11 April 2018 by Bbmmall (talk | contribs) (Solution)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

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

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
Invalid username
Login to AoPS