Maths Olympiad Prep

Track / Stage 7 / 6 of 300 #1406 of 1964

Problem 1406

National olympiad second round; IMO P1/P4
Combinatorics Difficulty 7.0 Prove it

Suppose that m=nqm=nq, where nn and qq are positive integers. Prove that the sum of binomial coefficients k=0n1(gcd(n,k)qgcd(n,k))\sum_{k=0}^{n-1}{ \gcd(n, k)q \choose \gcd(n, k)} is divisible by mm.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

1. Lemma: We start by proving the lemma that XαXα+1(modpα+1) X_{\alpha} \equiv X_{\alpha + 1} \pmod{p^{\alpha + 1}} , where p p is a prime and Xα=(dpαq1dpα1) X_{\alpha} = \binom{dp^{\alpha}q - 1}{dp^{\alpha} - 1} .

2. Define f(x)=(x1)(x2)(xp+1) f(x) = (x - 1)(x - 2) \cdots (x - p + 1) , where p p is a prime.

3. Using the definition of the binomial coefficient, expand Xα X_{\alpha} and Xα+1 X_{\alpha + 1} :
Xα+1Xα=Xα(f(dpα+1q)f(dpα+1qp)f(dpα+1qdpα+1+p)f(dpα+1)f(dpα+1p)f(p)1) X_{\alpha + 1} - X_{\alpha} = X_{\alpha} \left( \frac{f(dp^{\alpha + 1}q) f(dp^{\alpha + 1}q - p) \cdots f(dp^{\alpha + 1}q - dp^{\alpha + 1} + p)}{f(dp^{\alpha + 1}) f(dp^{\alpha + 1} - p) \cdots f(p)} - 1 \right)

4. Note that f(kp) f(kp) is not a multiple of p p .

5. We need to show:
f(dpα+1q)f(dpα+1qp)f(dpα+1qdpα+1+p)f(dpα+1)f(dpα+1p)f(p)(modpα+1) f(dp^{\alpha + 1}q) f(dp^{\alpha + 1}q - p) \cdots f(dp^{\alpha + 1}q - dp^{\alpha + 1} + p) \equiv f(dp^{\alpha + 1}) f(dp^{\alpha + 1} - p) \cdots f(p) \pmod{p^{\alpha + 1}}

6. This is obvious because f(dpα+1qkp)f(dpα+1kp)(modpα+1) f(dp^{\alpha + 1}q - kp) \equiv f(dp^{\alpha + 1} - kp) \pmod{p^{\alpha + 1}} for any integer k k .

7. This completes the proof of our lemma.

8. Main Problem: We need to prove that the sum of binomial coefficients:
k=0n1(gcd(n,k)qgcd(n,k)) \sum_{k=0}^{n-1} \binom{\gcd(n, k)q}{\gcd(n, k)}
is divisible by m m .

9. It is equivalent to:
ndn(dq1d1)ϕ(nd) n \mid \sum_{d \mid n} \binom{dq - 1}{d - 1} \phi\left(\frac{n}{d}\right)

10. Denote n=pαm n = p^{\alpha}m where (m,p)=1 (m, p) = 1 . We need to show:
pαdmk=0α(dpkq1dpk1)ϕ(pαkmd) p^{\alpha} \mid \sum_{d \mid m} \sum_{k=0}^{\alpha} \binom{dp^kq - 1}{dp^k - 1} \phi\left(\frac{p^{\alpha - k}m}{d}\right)

11. We need to show pαAα p^{\alpha} \mid A_{\alpha} , where:
Aα=k=0α(dpkq1dpk1)ϕ(pαkmd) A_{\alpha} = \sum_{k=0}^{\alpha} \binom{dp^kq - 1}{dp^k - 1} \phi\left(\frac{p^{\alpha - k}m}{d}\right)

12. Use induction on α \alpha .

13. Note that:
Aα+1=k=0α+1(dpkq1dpk1)ϕ(pα+1kmd) A_{\alpha + 1} = \sum_{k=0}^{\alpha + 1} \binom{dp^kq - 1}{dp^k - 1} \phi\left(\frac{p^{\alpha + 1 - k}m}{d}\right)

14. Using properties of Euler's totient function:
ϕ(mpd)=(p1)ϕ(md),ϕ(mpad)=pϕ(ma1d) for a>1 \phi\left(\frac{mp}{d}\right) = (p - 1) \phi\left(\frac{m}{d}\right), \quad \phi\left(\frac{mp^a}{d}\right) = p \phi\left(\frac{m^{a - 1}}{d}\right) \text{ for } a > 1

15. We get:
Aα+1=pAα+(dqpα+11dpα+11)ϕ(md)(dqpα1dpα1)ϕ(md) A_{\alpha + 1} = pA_{\alpha} + \binom{dqp^{\alpha + 1} - 1}{dp^{\alpha + 1} - 1} \phi\left(\frac{m}{d}\right) - \binom{dqp^{\alpha} - 1}{dp^{\alpha} - 1} \phi\left(\frac{m}{d}\right)

16. Thus:
Aα+1ϕ(md)((dqpα+11dpα+11)(dqpα1dpα1))0(modpα+1) A_{\alpha + 1} \equiv \phi\left(\frac{m}{d}\right) \left( \binom{dqp^{\alpha + 1} - 1}{dp^{\alpha + 1} - 1} - \binom{dqp^{\alpha} - 1}{dp^{\alpha} - 1} \right) \equiv 0 \pmod{p^{\alpha + 1}}
by the lemma.

17. This completes our induction.

\blacksquare

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