Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /239 of 395

Saudi Arabian Mathematical Competitions, 2012

Number theory Difficulty 5.9 AIME, harder Prove it Saudi Arabia

Given an odd number n≥3n \ge 3, let
S={k:1≤k≤n,gcd⁡(k,n)=1} S = \{k : 1 \le k \le n, \gcd(k, n) = 1\}
and let
T={k:k∈S,gcd⁡(k+1,n)=1}. T = \{k : k \in S, \gcd(k + 1, n) = 1\}.
For each k∈Sk \in S, let rkr_k be the remainder left by k∣S∣−1n\frac{k|S| - 1}{n} upon division by nn. Show that
∏k∈T(rk−rn−k)≡∣S∣∣T∣(modn). \prod_{k \in T} (r_k - r_{n-k}) \equiv |S|^{|T|} \pmod{n}.

Solution

Since nn is odd,
∣S∣=ϕ(n)=n∏p∣n(1−1/p) |S| = \phi(n) = n \prod_{p|n} (1 - 1/p)
is even. Given an element kk of SS, write
k∣S∣≡1+nrk(modn2)k^{|S|} \equiv 1+nr_k \pmod{n^2} and (n−k)∣S∣≡1+nrn−k(modn2)(n-k)^{|S|} \equiv 1+nr_{n-k} \pmod{n^2}, and notice that
(n−k)∣S∣≡k∣S∣⋅n⋅k∣S∣−1(modn2), (n-k)^{|S|} \equiv k^{|S|} \cdot n \cdot k^{|S|-1} \pmod{n^2},
to get
rk−rn−k≡∣S∣⋅k∣S∣−1(modn). r_k - r_{n-k} \equiv |S| \cdot k^{|S|-1} \pmod{n}.
Hence
∏k∈T(rk−rn−k)≡∣S∣∣T∣(∏k∈Tk)∣S∣−1(modn). \prod_{k \in T} (r_k - r_{n-k}) \equiv |S|^{|T|} \left(\prod_{k \in T} k\right)^{|S|-1} \pmod{n}.
Finally, notice that the product in the right-hand member is congruent to 1 modulo nn. To see this, let k′k' denote the modulo nn multiplicative inverse of an element kk of SS, and notice that
k′+1≡k′(k+1)(modn)and(k−1)(k′+1)≡k−k′(modn). k'+1 \equiv k'(k+1) \pmod{n} \quad \text{and} \quad (k-1)(k'+1) \equiv k-k' \pmod{n}.
The first congruence shows that if kk belongs to TT, then so does k′k', and the second shows that k=k′k = k' if and only if k=1k = 1. Consequently, if k≠1k \neq 1, the factors kk and k′k' in the product can be paired off and the conclusion follows.

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.