Maths Olympiad Prep

Library / Taiwan IMO Selection Camp /147 of 359

Taiwan IMO Selection Camp

Number theory Difficulty 5.6 AIME, harder Prove it Taiwan

Let pp be an odd prime. For each positive integer aa, define SaS_a as follows:
Sa=a1+a22+⋯+ap−1p−1. S_a = \frac{a}{1} + \frac{a^2}{2} + \cdots + \frac{a^{p-1}}{p-1}.
Let mm and nn be positive integers such that
S3+S4−3S2=mn. S_3 + S_4 - 3S_2 = \frac{m}{n}.
Prove that pp divides mm.

Solution

For rational numbers p1/q1p_1/q_1 and p2/q2p_2/q_2 where p∤q1,p∤q2p \nmid q_1, p \nmid q_2. If p∣(p1q2−p2q1)p|(p_1q_2 - p_2q_1), we write p1/q1≡p2/q2(modp)p_1/q_1 \equiv p_2/q_2 \pmod p.
We begin with SaS_a modulo pp. Observe: p∣((pk))p|(\binom{p}{k}), k=1,⋯ ,p−1k = 1, \cdots, p-1 and
1p(pk)=(p−1)(p−2)⋯(p−k+1)k!≡(−1)⋅(−2)⋯(−k+1)k!=(−1)k−1(modp). \begin{aligned} \frac{1}{p}\binom{p}{k} &= \frac{(p-1)(p-2)\cdots(p-k+1)}{k!} \\ &\equiv \frac{(-1)\cdot(-2)\cdots(-k+1)}{k!} = (-1)^{k-1} \pmod{p}. \end{aligned}
Then, we have
Sa=−∑k=1p−1(−a)k(−1)k−1k≡−∑k=1p−1(−a)k⋅1p(pk)(modp). S_a = - \sum_{k=1}^{p-1} \frac{(-a)^k (-1)^{k-1}}{k} \equiv - \sum_{k=1}^{p-1} (-a)^k \cdot \frac{1}{p} \binom{p}{k} \pmod{p}.
The right-hand side of the above expression is an integer. By the binomial theorem, we obtain
−∑k=1p−1(−a)k⋅1p(pk)=−1p(−1−(−a)p+∑k=1p(−a)k(pk))=(a−1)p−ap+1p - \sum_{k=1}^{p-1} (-a)^k \cdot \frac{1}{p} \binom{p}{k} = - \frac{1}{p} \left( -1 - (-a)^p + \sum_{k=1}^{p} (-a)^k \binom{p}{k} \right) = \frac{(a-1)^p - a^p + 1}{p}
since pp is odd. Hence
Sa≡(a−1)p−ap+1p(modp). S_a \equiv \frac{(a-1)^p - a^p + 1}{p} \pmod{p}.
Finally, we obtain
S3+S4−3S2≡(2p−3p+1)+(3p−4p+1)−3(1p−2p+1)p=4⋅2p−4p−4p=−(2p−2)2p(modp). \begin{aligned} S_3 + S_4 - 3S_2 &\equiv \frac{(2^p - 3^p + 1) + (3^p - 4^p + 1) - 3(1^p - 2^p + 1)}{p} \\ &= \frac{4 \cdot 2^p - 4^p - 4}{p} = -\frac{(2^p - 2)^2}{p} \pmod{p}. \end{aligned}
By Fermat's theorem, p∣(2p−2)p|(2^p - 2), so p2∣(2p−2)2p^2|(2^p - 2)^2. Therefore
S3+S4−3S2≡0(modp). S_3 + S_4 - 3S_2 \equiv 0 \pmod{p}.

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 translated into English from zh; metadata (topic, difficulty) added by this project.