Disproving a statement with a counter-example
Kofi says,
" is a prime number for every positive integer ."
Show that Kofi is wrong. [1]
- 1
Trying gives , which are all prime. That is why the statement looks true. Look for a value of that makes every term share a factor: when , both and are multiples of .
- 2
B1 Substitute and show the result is not prime.
Answer
When , , which is not prime, so Kofi is wrong.
Examiner tip
Examiner tip: One counter-example is enough to disprove a statement, but you must show both the value and why it fails. Writing without leaves the reason unstated.
Common mistake: Checking a few values, finding they are all prime, and concluding that Kofi is right. Examples can never prove a statement is true for every ; they can only disprove it.