Maths Olympiad Prep

Library / Iranian Mathematical Olympiad /98 of 270

Iranian Mathematical Olympiad

Number theory Difficulty 6.3 National Olympiad Prove it Iran

Let pp be an odd prime number. Find all p−12\frac{p-1}{2}-tuples (x1,x2,…,xp−12)∈Zp2p−12(x_1, x_2, \dots, x_{\frac{p-1}{2}}) \in \mathbb{Z}_{p^2}^{\frac{p-1}{2}} such that
∑i=1p−12xi≡∑i=1p−12xi2≡⋯≡∑i=1p−12xip−12(modp). \sum_{i=1}^{\frac{p-1}{2}} x_i \equiv \sum_{i=1}^{\frac{p-1}{2}} x_i^2 \equiv \dots \equiv \sum_{i=1}^{\frac{p-1}{2}} x_i^{\frac{p-1}{2}} \pmod{p}.

Solution

Assume that p=3p = 3. Then obviously x1x_1 can take any value. Now suppose that p≥5p \ge 5. We want to prove that (x1,x2,…,xp−12)∈{0,1}p−12(x_1, x_2, \dots, x_{\frac{p-1}{2}}) \in \{0, 1\}^{\frac{p-1}{2}}. Note that
∑i=1p−12(1−axi)p−12≡p−12+M((1−a)p−12−1)(modp), \sum_{i=1}^{\frac{p-1}{2}} (1 - a x_i)^{\frac{p-1}{2}} \equiv \frac{p-1}{2} + M \left( (1-a)^{\frac{p-1}{2}} - 1 \right) \pmod{p},
where MM is common value mod pp of
∑i=1p−12xij(1≤j≤p−12). \sum_{i=1}^{\frac{p-1}{2}} x_i^j \quad \left(1 \le j \le \frac{p-1}{2}\right).
If we choose aa such that (1−a)p−12=1(1-a)^{\frac{p-1}{2}} = 1, then by using (1−axi)p−12=±1(1-ax_i)^{\frac{p-1}{2}} = \pm 1 or 00 and the above equation we have for each ii,
(1−axi)p−12=(1−axkp)=1 (1 - a x_i)^{\frac{p-1}{2}} = \left( \frac{1 - a x_k}{p} \right) = 1
So if (tp)=1\left(\frac{t}{p}\right) = 1 we get
(1−(1−t)xip)=1 \left( \frac{1 - (1 - t)x_i}{p} \right) = 1
Now if xi≠0x_i \ne 0 then the map f(t)=1−(1−t)xif(t) = 1 - (1-t)x_i is bijective. Hence if PP is the set of square remainder, ff define a bijection from PP to itself and
∑t∈Pf(t)=∑t∈Pt=0, \sum_{t \in P} f(t) = \sum_{t \in P} t = 0,
which implies that xi=1x_i = 1.

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.