Maths Olympiad Prep

Track / Stage 7 / 57 of 300 #1457 of 1964

Problem 1457

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.1 Prove it

Let p>7p>7 be a prime and let AA be subset of {0,1,,p1}\{0,1, \ldots, p-1\} with size at least p12\frac{p-1}{2}. Show that for each integer rr, there exist a,b,c,dAa, b, c, d \in A, not necessarily distinct, such that abcdr(modp)ab-cd \equiv r \pmod p.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

1. Initial Setup and Assumptions:
Let p>7 p > 7 be a prime and let A A be a subset of {0,1,,p1} \{0, 1, \ldots, p-1\} with size at least p12 \frac{p-1}{2} . We need to show that for each integer r r , there exist a,b,c,dA a, b, c, d \in A , not necessarily distinct, such that abcdr(modp) ab - cd \equiv r \pmod{p} .

2. Normalization:
There exists an xA{0} x \in A \setminus \{0\} . By replacing every element y y of A A with yx1modp yx^{-1} \mod{p} and r r with rx2(modp) rx^{-2} \pmod{p} , we can assume that 1A 1 \in A .

3. **Definition of Set B B :**
Let B={ab(modp)a,bA} B = \{ab \pmod{p} \mid a, b \in A\} . Clearly, AB A \subseteq B .

4. **Case Analysis on Size of B B :**
- If B>p12 |B| > \frac{p-1}{2} , we are done because B B would cover all residues modulo p p , ensuring abcdr(modp) ab - cd \equiv r \pmod{p} for some a,b,c,dA a, b, c, d \in A .
- Assume B=p12 |B| = \frac{p-1}{2} . Then B=A=p12 |B| = |A| = \frac{p-1}{2} and thus B=A B = A .

5. Subgroup Structure:
- For xA{0} x \in A \setminus \{0\} , multiplication with x x permutes the elements of A A . Hence, A{0} A \setminus \{0\} is a subgroup of Fp \mathbb{F}_p^* .
- By Lagrange's Theorem, A{0}p1 |A \setminus \{0\}| \mid p-1 . For p>7 p > 7 , we cannot have p32p1 \frac{p-3}{2} \mid p-1 . Therefore, 0∉A 0 \not\in A and A A is a subgroup of FpZ/(p1)Z \mathbb{F}_p^* \cong \mathbb{Z}/(p-1)\mathbb{Z} with p12 \frac{p-1}{2} elements.

6. Quadratic Residues:
The only such subgroup is the subgroup of quadratic residues. Thus, A=B A = B is the set of nonzero quadratic residues.

7. **Handling r r :**
- If r≢±1(modp) r \not\equiv \pm 1 \pmod{p} , choose the quadratic residues ab=(r+12)2 ab = \left(\frac{r+1}{2}\right)^2 and cd=(r12)2 cd = \left(\frac{r-1}{2}\right)^2 from B B .
- We need to show that there are two non-zero quadratic residues with difference 1(modp) 1 \pmod{p} for p>7 p > 7 .

8. Existence of Quadratic Residues with Difference 1:
- Note that there are 3 quadratic residues in {1,2,3,4} \{1, 2, 3, 4\} or 4 quadratic residues in {4,5,6,7,8,9} \{4, 5, 6, 7, 8, 9\} or p72 \frac{p-7}{2} quadratic residues in {9,10,,p1} \{9, 10, \ldots, p-1\} .
- Therefore, one of these sets contains two quadratic residues with difference 1 1 .

Thus, for each integer r r , there exist a,b,c,dA a, b, c, d \in A such that abcdr(modp) ab - cd \equiv r \pmod{p} .

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.