Maths Olympiad Prep

Library / /7 of 740

, 2023

Combinatorics Difficulty 4.0 AMC 10/12 Find the answer United States

Problem:

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

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

The largest aa such that 7a7^{a} divides (2kk)\binom{2k}{k} is equal to the number of carries when you add k+kk + k in base 77, by Kummer's Theorem. Thus, we need two carries, so 2k2k must have at least 33 digits in base 77. Hence, 2k492k \geq 49, so 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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.