Maths Olympiad Prep

Library / China Mathematical Competition (Complementary Test) /2 of 17

China Mathematical Competition (Complementary Test)

Combinatorics Difficulty 5.4 AIME, harder Prove it China

Suppose that kk, ll are two positive integers.
Prove that:
There are infinitely many positive integers m≥km \ge k such that (mk)\binom{m}{k} and ll are relatively prime.

Solutions — 2

Solution 1

Let m=k+t×l×(k!)m = k + t \times l \times (k!), where tt is any positive integer. To prove that (mk)\binom{m}{k} and ll are relatively prime, we only need to prove that for any prime factor pp of ll, p∤(mk)p \nmid \binom{m}{k}.

If p∤k!p \nmid k!, we have
k!(mk)=∏i=1k(m−k+i)=∏i=1k[i+tl(k!)]=∏i=1ki≡k!(modp). \begin{aligned} k! \binom{m}{k} &= \prod_{i=1}^{k} (m-k+i) \\ &= \prod_{i=1}^{k} [i + t l (k!)] \\ &= \prod_{i=1}^{k} i \equiv k! \pmod{p}. \end{aligned}
Therefore, p∤(mk)p \nmid \binom{m}{k}.

If p∣k!p \mid k!, there exists integer α≥1\alpha \ge 1 such that pα∣k!p^\alpha \mid k! but pα+1∤k!p^{\alpha+1} \nmid k!. Then pα+1∣l(k!)p^{\alpha+1} \mid l(k!).
We have
k!(mk)=∏i=1k(m−k+i)=∏i=1k[i+tl(k!)]=∏i=1ki≡k!(modpα+1). \begin{aligned} k! \binom{m}{k} &= \prod_{i=1}^{k} (m-k+i) \\ &= \prod_{i=1}^{k} [i + t l (k!)] \\ &= \prod_{i=1}^{k} i \equiv k! \pmod{p^{\alpha+1}}. \end{aligned}
Therefore, pα∣k!(mk)p^\alpha \mid k! \binom{m}{k} and pα+1∤k!(mk)p^{\alpha+1} \nmid k! \binom{m}{k}. Since pα∣k!p^\alpha \mid k!, we get p∤(mk)p \nmid \binom{m}{k}. The proof is completed.

Solution 2

Let m=k+t×l×(k!)zm = k + t \times l \times (k!)^z, where tt is any positive integer. The following proof steps are similar to those in Solution I, and are omitted.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.