Maths Olympiad Prep

Library / /7 of 18

Number theory Difficulty 5.7 AIME, harder Prove it Austria

Let p1,p2,,p42p_1, p_2, \dots, p_{42} be 42 pairwise different primes. Prove that the number
j=1421pj2+1 \sum_{j=1}^{42} \frac{1}{p_j^2 + 1}
cannot be equal to the reciprocal 1n2\frac{1}{n^2} of a perfect square.

Solution

We assume that the sum in question can be written as the reciprocal of a perfect square n2n^2. Let P:=j=142(pj2+1)P := \prod_{j=1}^{42} (p_j^2 + 1) be the product of all denominators of the summed fractions. We then have
j=1421pj2+1=1n2    n2j=142Ppj2+1=P. \sum_{j=1}^{42} \frac{1}{p_j^2 + 1} = \frac{1}{n^2} \iff n^2 \cdot \sum_{j=1}^{42} \frac{P}{p_j^2 + 1} = P.
We now consider both sides of this equation modulo 3.

Case 1: If none of the numbers pjp_j is equal to 3, each factor pj2+1p_j^2 + 1 is congruent to 1-1 modulo 3. We therefore have P1(mod3)P \equiv 1 \pmod{3} and each expression Ppj2+1\frac{P}{p_j^2+1} is congruent to 1-1 modulo 3. The left side of the equation is therefore divisible by 3, which yields a contradiction.

Case 2: If pj=3p_j = 3 holds for some index jj, we have 32+11(mod3)3^2 + 1 \equiv 1 \pmod{3}, and therefore P1(mod3)P \equiv -1 \pmod{3}. In the sum j=142Ppj2+1\sum_{j=1}^{42} \frac{P}{p_j^2+1} we therefore have one number congruent to 1-1 (mod 3) and 41 congruent to 1. The sum is therefore congruent to 1, and since we either have n20(mod3)n^2 \equiv 0 \pmod{3} or n21(mod3)n^2 \equiv 1 \pmod{3}, the left side is certainly not congruent to 1-1, which again yields a contradiction.

We see that the sum in question cannot be the reciprocal of a perfect square, as claimed. qed

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.