Disproof by counter example
Studying this course? Keep your progress in one place.
Key facts
- A statement about all values is disproved by a single counterexample.
- The counterexample must satisfy the conditions of the statement.
- Substitute it, show the statement fails, and write a conclusion.
- Test small values, zero, negatives, fractions between and , and for primes.
- Examples that agree can never prove a statement.
What a counterexample does
One valid value for which the statement is false is enough to disprove it.
Many statements say something is true for all values in a set, such as "for all integers ". To disprove one you need only a single counterexample.
That is why disproof is simpler than proof. The value must satisfy the conditions of the statement, and you must show clearly that it fails.
- One valid counterexampledisproves the statement
How many counterexamples do you need to disprove a statement?
Setting out a disproof
Choose a valid value, substitute it, show the statement fails, and conclude.
Calculate both sides, or each part of the statement. When the statement is about prime numbers, show the factors of the non-prime value, for example .
- 1
Choose
A value that satisfies the conditions
- 2
Substitute
Calculate both sides or each part
- 3
Show it fails
Give the factors if a number is not prime
- 4
Conclude
"So the statement is false"
Worked example
Disprove the statement: ' is prime for all integers '.
- 1
: , which is prime.
- 2
: , which is prime.
- 3
: , which is prime.
- 4
: , which is not prime.
Is a valid test value for the statement above?
Choosing values to test
Try small values first, then zero, , negatives, fractions between and , and the prime .
Fractions between and are useful because squares are smaller, not larger. Numbers of opposite sign, such as and , help when the statement involves squares.
Worked example
Disprove statement T: ' for all real '.
- 1
Try : .
- 2
is not greater than .
Which value is a counterexample to ' for all real '?
Further examples
Each follows the same pattern: test values, find one that fails, and state it.
Keep testing different kinds of values until one fails.
| Counterexample | Why it fails | |
|---|---|---|
| If is prime then is prime | ||
| If then | , | but |
| is prime | ||
| but |
Counterexample
- If is prime then is prime:
- If then :
- ,
- is prime:
- :
Why it fails
- If is prime then is prime:
- If then :
- but
- is prime:
- :
- but
Worked example 1
Disprove: 'If is prime then is prime.'
- 1
Try : is prime. Try : is prime.
- 2
Try : , which is not prime.
Worked example 2
Disprove: 'If then .'
- 1
Take , .
- 2
Then but .
Which value is a counterexample to 'if is prime then is prime'?
What disproof cannot do
A counterexample disproves a statement, but examples that agree can never prove one.
You need only one counterexample: not all of them, and not an explanation of why. If a student tests a few values and calls it proved, a finite number of agreeing cases says nothing about the rest.
- Counterexampledisproves
- Agreeing examplesnever prove
Worked example
Is ' for all real ' true?
- 1
Expand: .
- 2
So the statement is true only when .
- 3
For example gives , which is false; gives , which is false.
A student tests and says the statement is proved. Why is this wrong?
Try an exam question
A student says " is prime for every positive integer ". Show that the student is wrong.
[3 marks]
- [1]Chooses a positive integer for which the statement fails, for example .
- [1]Calculates .
- [1]Shows is not prime, so the statement is false.
That's the notes covered.
Carry on to the next subtopic.
Try a question
Which value of is a counterexample to T?
1 mark, marked against the mark scheme
Which value of is a counterexample to T?
1 mark, marked against the mark scheme