Olympiad Maths Prep

Track / Stage 8 / 112 of 180 #1812 of 2000

Problem 1812

IMO Shortlist mid-range; USAMO P2/P5
Combinatorics Difficulty 8.6 Prove it Baltic Way 2023 Shortlist · Baltic Way · 2023

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

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Let PP be the set of possible products abab, for a,bAa, b \in A. Clearly, PaAp12|P| \ge |aA| \ge \frac{p-1}{2}, for any aAa \in A. If Pp+12|P| \ge \frac{p+1}{2}, then r+Pp+12|r + P| \ge \frac{p+1}{2}, too. Hence, P+r+Pp+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 p1r+p2(modp)p_1 \equiv r + p_2 \pmod{p} and hence p1p2r(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=p12|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 1A1 \in A. Then APA \subseteq P and hence A=PA = P. This means that the non-zero elements of AA form a group under multiplication.

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

Consequently, 0A0 \notin A and the group has size p12\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:=1Ab = 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(r12)2(modp). c \equiv \left( \frac{r-1}{2} \right)^2 \pmod{p}.
Then a,cAa, c \in A, too. This yields
adbcac(r+12)2(r12)2r(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.

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