MathLabs

Problem 3

Prove that there are infinitely many positive integers nn such that n2+1n^2+1 has a prime factor greater than 2n+2n2n+\sqrt{2n}.
Step 4 of 6: Claim: t is at least (h-1)/2, proved by a mod-8 contradiction
t<h−12  ⟹  (2t+1)2+4=p, impossible mod 8t < \tfrac{h-1}2 \implies (2t+1)^2+4 = p,\ \text{impossible mod } 8
Detailed analysis

Suppose for contradiction that t<h−12t<\frac{h-1}2, i.e.\ 2t+1<h2t+1<h. Then 0<(2t+1)2+4<h2+40<(2t+1)^2+4<h^2+4. Since h=⌈p⌉h=\lceil\sqrt p\rceil and p≥2013p\ge2013, we have h2+4<2ph^2+4<2p, so (2t+1)2+4(2t+1)^2+4 is a positive multiple of pp (by the previous step) that is less than 2p2p, forcing (2t+1)2+4=p(2t+1)^2+4=p. But 2t+12t+1 is odd, and every odd square is ≡1(mod8)\equiv1\pmod8, so (2t+1)2+4≡5(mod8)(2t+1)^2+4\equiv5\pmod8; since p≡1(mod8)p\equiv1\pmod8, this is a contradiction. Hence t≥h−12t\ge\frac{h-1}2, i.e.\ x=p+12+t≥p+h2x=\frac{p+1}2+t\ge\frac{p+h}2.