Olympiad Maths Prep

Track / Stage 5 / 247 of 400 #847 of 2000

Problem 847

AIME late
Number theory Difficulty 5.6 Prove it 二〇一二數學奧林匹亞競賽第三階段選訓營 · Taiwan

pp 為一奇質數。對每一個正整數 aa, 定義 SaS_a 如下:
Sa=a1+a22++ap1p1. S_a = \frac{a}{1} + \frac{a^2}{2} + \cdots + \frac{a^{p-1}}{p-1}.
mmnn 為正整數使得
S3+S43S2=mn. S_3 + S_4 - 3S_2 = \frac{m}{n}.
試證: pp 能整除 mm.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

對於有理數 p1/q1p_1/q_1p2/q2p_2/q_2 其中 pq1,pq2p \nmid q_1, p \nmid q_2。若 p(p1q2p2q1)p|(p_1q_2 - p_2q_1), 記為 p1/q1p2/q2(modp)p_1/q_1 \equiv p_2/q_2 \pmod p
SaS_app 開始。觀察: p((pk))p|(\binom{p}{k}), k=1,,p1k = 1, \cdots, p-1
1p(pk)=(p1)(p2)(pk+1)k!(1)(2)(k+1)k!=(1)k1(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}
則, 我們有
Sa=k=1p1(a)k(1)k1kk=1p1(a)k1p(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}.
上式之右邊是一整數。由二項式定理, 得
k=1p1(a)k1p(pk)=1p(1(a)p+k=1p(a)k(pk))=(a1)pap+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}
pp 是奇數。故
Sa(a1)pap+1p(modp). S_a \equiv \frac{(a-1)^p - a^p + 1}{p} \pmod{p}.
最後, 可得
S3+S43S2(2p3p+1)+(3p4p+1)3(1p2p+1)p=42p4p4p=(2p2)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}
由 Fermat 定理, p(2p2)p|(2^p - 2), 故 p2(2p2)2p^2|(2^p - 2)^2。所以
S3+S43S20(modp). S_3 + S_4 - 3S_2 \equiv 0 \pmod{p}.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.