Disproof by Counter Example (Edexcel A-Level Mathematics): Revision Notes
1.1.4 Disproof by Counter Example
Proof by Counter example
- Concept:
- "It takes one black swan to kill a maxim." - Vladimir Voevodsky (2007)
- One counterexample collapses an argument.
Step-by-step method:
Step 1: Understand the Statement
First, make sure you understand the statement you're trying to disprove. Identify whether it is a general statement (often using words like "all", "every", or "for every") that claims something is true for a broad set of values.
For example, consider the statement: "All numbers that are multiples of 2 are also multiples of 4."
Step 2: Identify What You Need to Disprove
You are looking for one example that does not satisfy the statement. In this case, you're trying to find a number that is a multiple of 2 but not a multiple of 4.
Step 3: Test Examples
Now, start testing specific examples that meet the first part of the statement. For our example, choose some numbers that are multiples of 2:
- 2, 4, 6, 8, 10...
Step 4: Find a Counterexample
Look for an example that breaks the statement. In our case, 6 is a multiple of 2, but it is not a multiple of 4 (since 6 ÷ 4 does not give a whole number).
Therefore, 6 is the counterexample that disproves the original statement.
Step 5: Conclude
Once you've found a counterexample, you can conclude that the statement is false. You don't need to check all cases—just one counterexample is enough to disprove the statement.
Summary
- Understand the statement you're trying to disprove.
- Identify what kind of example would contradict the statement.
- Test specific examples that fit part of the statement.
- Find a counterexample that breaks the statement.
- Conclude that the statement is false.
Example: Disprove the following statement by mean of counterexample
- Statement: is always prime for any positive integer .
- Counterexample:
- (not prime)
- Important: Finding a counterexample is a very important step.
Example Problem: All prime numbers are odd.
- Identify a counterexample:
- Consider the prime number .
- Check if it contradicts the statement:
- The number is a prime number because its only divisors are and .
- However, is not odd; it is even.
- Conclusion:
- The existence of the prime number , which is even, contradicts the statement that all prime numbers are odd. Therefore, the statement "All prime numbers are odd" is false. The counterexample () successfully disproves it.