Olympiad Maths Prep

Library / /13 of 29

Number theory Difficulty 6.3 National olympiad Prove it Iran

Let pp be an odd prime number. Find all p12\frac{p-1}{2}-tuples (x1,x2,,xp12)Zp2p12(x_1, x_2, \dots, x_{\frac{p-1}{2}}) \in \mathbb{Z}_{p^2}^{\frac{p-1}{2}} such that
i=1p12xii=1p12xi2i=1p12xip12(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 p5p \ge 5. We want to prove that (x1,x2,,xp12){0,1}p12(x_1, x_2, \dots, x_{\frac{p-1}{2}}) \in \{0, 1\}^{\frac{p-1}{2}}. Note that
i=1p12(1axi)p12p12+M((1a)p121)(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=1p12xij(1jp12). \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 (1a)p12=1(1-a)^{\frac{p-1}{2}} = 1, then by using (1axi)p12=±1(1-ax_i)^{\frac{p-1}{2}} = \pm 1 or 00 and the above equation we have for each ii,
(1axi)p12=(1axkp)=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(1t)xip)=1 \left( \frac{1 - (1 - t)x_i}{p} \right) = 1
Now if xi0x_i \ne 0 then the map f(t)=1(1t)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
tPf(t)=tPt=0, \sum_{t \in P} f(t) = \sum_{t \in P} t = 0,
which implies that xi=1x_i = 1.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

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