Problem 3
Prove that there are infinitely many positive integers such that has a prime factor greater than .
Step 3 of 6: Rewrite the divisibility x^2 = -1 mod p in terms of t
Detailed analysis
Since , also . Substituting gives , and since , we get . This congruence will let us bound from below.