MathCastle
Proof WritingHardWhat a Proof Is

What a Proof Is · Hard problem

Someone computes n2−79n+1601n^2 - 79n + 1601 for n=1,2,3,…n = 1, 2, 3, \ldots and gets a prime every time, well past n=50n = 50. They conclude it is prime for every positive integer nn. What is the smallest positive nn for which it is NOT prime?