Problem 3
Prove that there are infinitely many positive integers such that has a prime factor greater than .
Step 4 of 6: Claim: t is at least (h-1)/2, proved by a mod-8 contradiction
Detailed analysis
Suppose for contradiction that , i.e.\ . Then . Since and , we have , so is a positive multiple of (by the previous step) that is less than , forcing . But is odd, and every odd square is , so ; since , this is a contradiction. Hence , i.e.\ .