You’re probably already familiar with the story about the mathematician who tries to explain proof by induction to two friends: a physicist and an engineer. After some deep thought, the engineer announces that he’s found a proof by induction that all odd numbers are prime: “Three is prime; five is prime; seven is prime; so all odd numbers are prime.” Trying to be tactful, the mathematician asks gently what happens if he tries to extend the sequence a bit further. The physicist chips in: “That’s easy. Three is prime; five is prime; seven is prime; nine isn’t prime; eleven is prime; thirteen is prime; so all odd numbers are prime to within experimental error…”
Although we laugh at “engineers’ induction” — extrapolating a general statement from the pattern you see in a finite number of cases — most of us have been guilty of it at some point. It can, of course, be a good way to generate conjectures which can then be proved or disproved properly, but it’s always dangerous to put too much faith in patterns.
A classic and well-known example is Moser’s “pizza-slicing” problem, which generates the sequence 1, 2, 4, 8, 16 — and then, unexpectedly, 31. Here, courtesy of a passing comment on Spiked Math, is a less well-known example. Continue reading →