- Home
- Courses
- Edexcel A-Level Maths
- Algebraic Methods (Year 2)
- Proof by Contradiction
Proof by Contradiction
Proof by contradiction is a powerful technique: to prove a statement true, you assume it is false and show that this forces an impossibility. It is the method behind the classic proofs that √2 is irrational and that there are infinitely many primes.
What you'll be able to do
- Understand the logic of proof by contradiction
- Set up the negation of a statement
- Prove a statement by reaching a contradiction
- Follow the standard proofs (√2 irrational, infinite primes)
The logic
To prove a statement by contradiction, ( is false) and reason logically until you reach something impossible. Since the reasoning is valid, the only flaw must be the assumption — so must be true.
Tip — Start every proof by clearly writing the assumption: “Assume, for contradiction, that …”.
Worked idea: √2 is irrational
Assume is rational, so in lowest terms. Squaring gives , so is even, hence is even. Writing leads to , so is also even — but then and share a factor of 2, contradicting “lowest terms”.
Example 1Why does the √2 proof work?
Other classic proofs
The same structure proves there are (assume finitely many, multiply them all and add 1, get a number with no prime factor in the list) and that there is no smallest positive rational number. Recognising the “assume the negation” opening is the key skill.
Formula recap
Common mistakes to avoid
Key takeaways
- Assume the statement is false, then derive a contradiction.
- The contradiction shows the assumption was wrong, so the statement is true.
- Know the standard results: √2 irrational, infinitely many primes.
Test yourself
Answer a few questions, then review anything you missed.
Prefer paper? Open the written self-check
Answer each question before opening its answer. This self-check does not record a quiz score.
To prove a statement by contradiction, you first:
- Assume it is false
- Assume it is true
- Test examples
- Differentiate
Show answer and explanation
Answer: Assume it is false
Assume the negation.
Reaching a contradiction shows the assumption was:
- False
- True
- Irrelevant
- Incomplete
Show answer and explanation
Answer: False
So the original statement is true.
In proving √2 is irrational, we assume √2 equals:
- in lowest terms
- an integer
- an even number
Show answer and explanation
Answer: in lowest terms
The rational assumption.
The √2 proof reaches a contradiction because a and b turn out to both be:
- Even
- Odd
- Prime
- Negative
Show answer and explanation
Answer: Even
Contradicting “lowest terms”.
If is even, then is:
- Even
- Odd
- Prime
- Zero
Show answer and explanation
Answer: Even
Key lemma in the √2 proof.
The proof that there are infinitely many primes assumes:
- There are finitely many primes
- There are no primes
- 2 is the only prime
- All numbers are prime
Show answer and explanation
Answer: There are finitely many primes
Then constructs a number contradicting that.
Keep practising
Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.
Related lessons
All 5 lessons- Same chapterAlgebraic FractionsSimplifying and combining algebraic fractions.
- Same chapterPartial FractionsSplitting fractions with distinct linear factors into partial fractions.
- Same chapterRepeated FactorsPartial fractions with a repeated linear factor.
Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.