Browse · MathNet
PrintAustriaMO2011
Austria 2011 number theory
Problem
Let be 42 pairwise different primes. Prove that the number cannot be equal to the reciprocal of a perfect square.
Solution
We assume that the sum in question can be written as the reciprocal of a perfect square . Let be the product of all denominators of the summed fractions. We then have We now consider both sides of this equation modulo 3.
Case 1: If none of the numbers is equal to 3, each factor is congruent to modulo 3. We therefore have and each expression is congruent to modulo 3. The left side of the equation is therefore divisible by 3, which yields a contradiction.
Case 2: If holds for some index , we have , and therefore . In the sum we therefore have one number congruent to (mod 3) and 41 congruent to 1. The sum is therefore congruent to 1, and since we either have or , the left side is certainly not congruent to , which again yields a contradiction.
We see that the sum in question cannot be the reciprocal of a perfect square, as claimed. qed
Case 1: If none of the numbers is equal to 3, each factor is congruent to modulo 3. We therefore have and each expression is congruent to modulo 3. The left side of the equation is therefore divisible by 3, which yields a contradiction.
Case 2: If holds for some index , we have , and therefore . In the sum we therefore have one number congruent to (mod 3) and 41 congruent to 1. The sum is therefore congruent to 1, and since we either have or , the left side is certainly not congruent to , which again yields a contradiction.
We see that the sum in question cannot be the reciprocal of a perfect square, as claimed. qed
Techniques
Inverses mod nPrime numbersFractions