Let be a prime and let be subset of with size at least . Show that for each integer , there exist , not necessarily distinct, such that .
Problem 1457
Official solution
1. Initial Setup and Assumptions:
Let be a prime and let be a subset of with size at least . We need to show that for each integer , there exist , not necessarily distinct, such that .
2. Normalization:
There exists an . By replacing every element of with and with , we can assume that .
3. **Definition of Set :**
Let . Clearly, .
4. **Case Analysis on Size of :**
- If , we are done because would cover all residues modulo , ensuring for some .
- Assume . Then and thus .
5. Subgroup Structure:
- For , multiplication with permutes the elements of . Hence, is a subgroup of .
- By Lagrange's Theorem, . For , we cannot have . Therefore, and is a subgroup of with elements.
6. Quadratic Residues:
The only such subgroup is the subgroup of quadratic residues. Thus, is the set of nonzero quadratic residues.
7. **Handling :**
- If , choose the quadratic residues and from .
- We need to show that there are two non-zero quadratic residues with difference for .
8. Existence of Quadratic Residues with Difference 1:
- Note that there are 3 quadratic residues in or 4 quadratic residues in or quadratic residues in .
- Therefore, one of these sets contains two quadratic residues with difference .
Thus, for each integer , there exist such that .