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 3 of 6: Rewrite the divisibility x^2 = -1 mod p in terms of t
4(x2+1)≡(2t+1)2+4(modp)4(x^2+1)\equiv(2t+1)^2+4 \pmod p
Detailed analysis

Since p∣x2+1p\mid x^2+1, also p∣4(x2+1)p\mid 4(x^2+1). Substituting x=p+12+tx=\frac{p+1}2+t gives 4x2+4=(p+1+2t)2+44x^2+4=(p+1+2t)^2+4, and since p+1+2t≡1+2t(modp)p+1+2t\equiv1+2t\pmod p, we get 4(x2+1)≡(2t+1)2+4(modp)4(x^2+1)\equiv(2t+1)^2+4\pmod p. This congruence will let us bound tt from below.