Can a pattern of examples establish a number rule?
Wrong
If n² + n + 41 is prime for the first several whole numbers, it must always be prime.
Why it feels right. A long run of matches feels like proof.
Right
A rule that claims to work for every number fails if even one example breaks it.
Worked example
- At n = 0, 1 and 2 the outputs are 41, 43 and 47.
- At n = 40, the output is 40² + 40 + 41 = 41², a composite number.