Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /135 of 395

Saudi Arabian Mathematical Competitions

Number theory Difficulty 5.3 AIME, harder Prove it Saudi Arabia

Let p≥3p \geq 3 be a prime. For j=1,2,…,p−1j=1,2, \ldots, p-1, let rjr_{j} be the remainder when the integer jp−1−1p\frac{j^{p-1}-1}{p} is divided by pp. Prove that
r1+2r2+…+(p−1)rp−1≡p+12( mod p) r_{1}+2 r_{2}+\ldots+(p-1) r_{p-1} \equiv \frac{p+1}{2}(\bmod p)

Solution

For j=1,2,…,p−1j=1,2, \ldots, p-1, we have
jp−1−1p=ajp+rj \frac{j^{p-1}-1}{p}=a_{j} p+r_{j}
for some integer aja_{j}. It follows
jp−jp=jajp+jrj, \frac{j^{p}-j}{p}=j a_{j} p+j r_{j},
hence
jp−j+(p−j)p−(p−j)p=jajp+jrj+(p−j)ap−jp+(p−j)rp−j. \frac{j^{p}-j+(p-j)^{p}-(p-j)}{p}=j a_{j} p+j r_{j}+(p-j) a_{p-j} p+(p-j) r_{p-j}.
We obtain
jp+(p−j)pp=jajp+jrj+(p−j)ap−jp+(p−j)rp−j+1. \frac{j^{p}+(p-j)^{p}}{p}=j a_{j} p+j r_{j}+(p-j) a_{p-j} p+(p-j) r_{p-j}+1.
Because
jp+(p−j)p=(p0)pp−(p1)pp−1j+…+(pp−1)pjp−1 j^{p}+(p-j)^{p}=\binom{p}{0} p^{p}-\binom{p}{1} p^{p-1} j+\ldots+\binom{p}{p-1} p j^{p-1}
we obtain that p2∣jp+(p−j)pp^{2} \mid j^{p}+(p-j)^{p} and we get for all j=1,2,…,p−1j=1,2, \ldots, p-1,
jrj+(p−j)rp−j+1≡0( mod p) j r_{j}+(p-j) r_{p-j}+1 \equiv 0 \quad(\bmod p)
Adding up all these relations it follows
2(r1+2r2+…+(p−1)rp−1)≡−(p−1)( mod p) 2\left(r_{1}+2 r_{2}+\ldots+(p-1) r_{p-1}\right) \equiv-(p-1)(\bmod p)
hence
r1+2r2+…+(p−1)rp−1≡p+12( mod p) r_{1}+2 r_{2}+\ldots+(p-1) r_{p-1} \equiv \frac{p+1}{2}(\bmod 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 reproduced verbatim; metadata (topic, difficulty) added by this project.