Browse · MathNet
PrintBaltic Way 2023 Shortlist
Baltic Way 2023 counting and probability
Problem
Let be a prime number and let consist of at least elements. Show that for each integer , there are elements such that
Solution
Let be the set of possible products , for . Clearly, , for any . If , then , too. Hence, , so, by the Pigeonhole Principle, and must have an element in common. In other words, there are with and hence , which gives a solution of the desired shape from the definition of . So the only remaining case is that of .
Multiplying all elements of with the same constant and reducing modulo , if necessary, we may assume w.l.o.g. that . Then and hence . This means that the non-zero elements of form a group under multiplication.
If , then this group has size , which has to divide the group order , and hence also has to divide . This is impossible for .
Consequently, and the group has size and hence is exactly the group of quadratic residues (here we use the existence of primitive roots implicitly).
Replacing by , if necessary, one may assume to be odd. Then put , as well as Then , too. This yields as required.
Multiplying all elements of with the same constant and reducing modulo , if necessary, we may assume w.l.o.g. that . Then and hence . This means that the non-zero elements of form a group under multiplication.
If , then this group has size , which has to divide the group order , and hence also has to divide . This is impossible for .
Consequently, and the group has size and hence is exactly the group of quadratic residues (here we use the existence of primitive roots implicitly).
Replacing by , if necessary, one may assume to be odd. Then put , as well as Then , too. This yields as required.
Techniques
Pigeonhole principleInverses mod nPrimitive roots mod p / p^nQuadratic residuesGroup Theory