Given a prime number congruent to modulo , show that for no integer numbers whose product is not divisible by .
, 2010
Solution
Suppose there are four such numbers. Without loss of generality, we may (and will) assume that they are jointly coprime: .
Reduction modulo shows that and exactly one of the numbers , say , must be odd.
Write
to deduce that the second factor above is congruent to modulo and infer thereby that in its decomposition into prime factors some prime occurs with an odd exponent.
Since is a quadratic non-residue modulo , it follows that and are both divisible by , and in the decomposition of into prime factors, occurs with an even exponent.
Hence is divisible by , and therefore so is . Notice that (for divides , but does not by assumption) to deduce that is divisible by . Then so is .
Consequently, all share the common factor , in contradiction with their joint coprimality.