MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

A student claims: "n2+n+41n^2 + n + 41 is prime for every integer n≥0n \ge 0." It works for n=0,1,2,…n = 0, 1, 2, \ldots for a long time. What is the smallest n≥0n \ge 0 that is a counterexample?

Practice more like this