Lesson 4 of 8 · 15 min
Examples and counterexamples
Disprove a "for all" statement with a single counterexample, prove a "there exists" statement with a single example, and see why examples alone never prove a general result.
What you will be able to do
- Explain why checking examples cannot prove a statement about infinitely many numbers.
- Disprove a statement or an implication with one counterexample, showing it meets the hypothesis and fails the conclusion.
- Prove a statement with one example.
In 1772, Leonhard Euler observed the prime-producing pattern now written as : it is prime for . Try it yourself: gives 43, gives 47, gives 53. The pattern holds all the way to .
| Prime? | ||
|---|---|---|
| 1 | 43 | yes |
| 2 | 47 | yes |
| 3 | 53 | yes |
| 4 | 61 | yes |
| 5 | 71 | yes |
| … | … | yes, every time |
| 38 | 1523 | yes |
| 39 | 1601 | yes |
| 40 | 1681 | no: |
At , . So the statement ", is prime" is false, and is a counterexample. Thirty-nine examples did not prove it; one counterexample disproved it.
Key idea
Counterexamples and examples
- A counterexample to "" is one value of for which is true and is false. One is enough to show the statement is false.
- An example is enough to prove "": show one that works.
- Examples can never prove a statement about infinitely many numbers, however many you check.
Trace both curves at . Where is not above ? Any positive integer there is a counterexample to "".
Find the smallest positive integer that is a counterexample to the statement "".
Worked example
Disproving a statement about squares
Prove or disprove: for all , if then .
Step 1: Test some values
: and . Positive values seem to work, so the trouble, if any, is with negatives.
Trying cases is how you find a counterexample, and how you decide whether to look for a proof instead.
Step 2: Choose a negative a
Let and . Then and , so : the hypothesis holds.
Step 3: Check the conclusion
and , so : the conclusion fails.
Step 4: Conclude
The hypothesis is true and the conclusion is false for , , so the statement is false.
Try it yourself first, then check the working one step at a time.
Answer
The statement is false. Counterexample: , gives , but .
Method
Test cases, especially negatives, zero and fractions.
Pick one value that makes the hypothesis true and the conclusion false.
Show both calculations and state the conclusion.
Watch out for
Choosing , : then , so the hypothesis fails and it is not a counterexample.
Common mistake
A counterexample must satisfy the hypothesis
To disprove "if is prime, then is prime", the value is no use: is not prime, so the statement makes no claim about it. You need a prime with composite, such as : .
Statement: "For all , if then ." Select every value of that is a counterexample.
Examples do prove "there exists". "There exists an even prime" is proved by . "" is proved by , because . And when a set is finite, you can prove a "for all" statement by checking every element. That is called proof by exhaustion: for example, every integer from 1 to 10 has a square with last digit 0, 1, 4, 5, 6 or 9, which you can check one by one.
Worked example
Sums of irrational numbers
(a) Disprove the statement "the sum of any two irrational numbers is irrational".
(b) Hence decide whether " such that " is true.
Step 1: Choose two irrationals that cancel
Let and . Both are irrational: if were a rational , then would be rational.
Step 2: Add them
, and .
Step 3: Conclude (a)
Two irrational numbers have a rational sum, so the statement is false.
Step 4: Answer (b)
The statement in (b) is the negation of the statement in (a), and the same pair is an example of it. So (b) is true.
A counterexample to a "for all" statement is an example for its "there exists" negation.
Try it yourself first, then check the working one step at a time.
Answer
(a) and are irrational, but their sum is rational. (b) True: the same pair works.
Method
Look for irrationals whose irrational parts cancel, such as and .
Show each chosen number really is irrational, and that the result is rational.
Watch out for
Using as an irrational number: .
Exam tip
How to write a counterexample
State the value, show the calculation, and say why it is a counterexample: "Let and . Then , but . So the hypothesis holds and the conclusion fails, and the statement is false." A bare "" may not earn the mark.
Summary
One counterexample disproves a statement; one example proves an statement.
No number of examples proves a statement about infinitely many numbers (but checking every case of a finite set is a proof).
A counterexample to must make true and false.
Show the working for a counterexample and say clearly which part holds and which fails.
Finished the lesson?
Try the 2 quick checks above and the lesson completes itself, or mark it complete now.