Maths Olympiad Prep

Library / Baltic Way Shortlist /57 of 92

Baltic Way Shortlist, 2023

Combinatorics Difficulty 8.6 Shortlist Prove it Baltic Way

Let p>7p > 7 be a prime number and let A⊆{0,1,…,p−1}A \subseteq \{0, 1, \dots, p-1\} consist of at least p−12\frac{p-1}{2} elements. Show that for each integer rr, there are elements a,b,c,d∈Aa, b, c, d \in A such that
ab−cd≡r(modp). ab - cd \equiv r \pmod{p}.

Solution

Let PP be the set of possible products abab, for a,b∈Aa, b \in A. Clearly, ∣P∣≥∣aA∣≥p−12|P| \ge |aA| \ge \frac{p-1}{2}, for any a∈Aa \in A. If ∣P∣≥p+12|P| \ge \frac{p+1}{2}, then ∣r+P∣≥p+12|r + P| \ge \frac{p+1}{2}, too. Hence, ∣P∣+∣r+P∣≥p+1>p|P| + |r + P| \ge p + 1 > p, so, by the Pigeonhole Principle, PP and r+Pr + P must have an element in common. In other words, there are p1,p2p_1, p_2 with p1≡r+p2(modp)p_1 \equiv r + p_2 \pmod{p} and hence p1−p2≡r(modp)p_1 - p_2 \equiv r \pmod{p}, which gives a solution of the desired shape from the definition of PP. So the only remaining case is that of ∣P∣=∣A∣=p−12|P| = |A| = \frac{p-1}{2}.

Multiplying all elements of AA with the same constant and reducing modulo pp, if necessary, we may assume w.l.o.g. that 1∈A1 \in A. Then A⊆PA \subseteq P and hence A=PA = P. This means that the non-zero elements of AA form a group under multiplication.

If 0∈A0 \in A, then this group has size p−32\frac{p-3}{2}, which has to divide the group order p−1p-1, and hence also has to divide 2=p−1−2⋅p−322 = p-1-2 \cdot \frac{p-3}{2}. This is impossible for p>7p > 7.

Consequently, 0∉A0 \notin A and the group has size p−12\frac{p-1}{2} and hence is exactly the group of quadratic residues (here we use the existence of primitive roots implicitly).

Replacing rr by r+pr+p, if necessary, one may assume rr to be odd. Then put b=d:=1∈Ab = d := 1 \in A, as well as
a≡(r+12)2(modp)and a \equiv \left( \frac{r+1}{2} \right)^2 \pmod{p} \quad \text{and}
c≡(r−12)2(modp). c \equiv \left( \frac{r-1}{2} \right)^2 \pmod{p}.
Then a,c∈Aa, c \in A, too. This yields
ad−bc≡a−c≡(r+12)2−(r−12)2≡r(modp), ad - bc \equiv a - c \equiv \left(\frac{r+1}{2}\right)^2 - \left(\frac{r-1}{2}\right)^2 \equiv r \pmod{p},
as required.

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.