Euler's polynomial p(n) = n² + n + 41 generates prime values for n = 1, 2, ..., 40, but p(41) = 41² is composite; this is a cautionary example showing that checking many cases does not constitute a proof.
factualpending
Speaker
Keith DevlinEvidence Quote
“p(n) = n² + n + 41 generates primes for the first 40 values, but p(41) = 1681 = 41².”
Created: 8/10/2026, 9:54:16 PM
Your notes
Loading notes...