Maths Olympiad Prep

Library / /45 of 348

Algebra Difficulty 4.6 AIME Find the answer

Compute the smallest positive integer kk such that 49 divides (2kk)\binom{2 k}{k}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

The largest aa such that 7a(2kk)7^{a} \left\lvert\,\binom{ 2 k}{k}\right. is equal to the number of carries when you add k+kk+k in base 7 , by Kummer's Theorem. Thus, we need two carries, so 2k2 k must have at least 3 digits in base 7 . Hence, k25k \geq 25. We know k=25k=25 works because 25+25=347+347=101725+25=34_{7}+34_{7}=101_{7} has two carries.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.