- Home
- Courses
- AQA A-Level Maths
- Proof
- Proof by Contradiction
Proof by Contradiction
To prove a statement by contradiction, you assume it is false and then reason until reality breaks — you reach something that cannot possibly be true. That impossibility means your assumption was wrong, so the statement must be true.
The big picture
Proof by contradiction feels like a magic trick the first time you see it, and then like the most natural thing in the world. The move is bold: to prove something is true, you begin by assuming it is false, and you follow that assumption faithfully until it collapses into an absurdity — like , or a number that is both even and odd. Since valid reasoning can never turn a true assumption into a falsehood, the only escape is that the assumption itself was false.
It is the sharpest tool in the proof kit, and AQA names two specific results you must be able to prove with it: that is irrational, and that there are infinitely many prime numbers. Both are over two thousand years old, and both are unreachable by the direct methods you have met so far — which is exactly why contradiction exists.
What you'll be able to do
- State the logic of proof by contradiction and negate a statement correctly
- Prove a lemma by contradiction: if is even then is even
- Reproduce the proof that is irrational
- Reproduce Euclid’s proof that there are infinitely many primes
The logic: assume the opposite
Every proof by contradiction follows the same three-beat rhythm. — suppose the statement you want is false. — apply valid steps, using the assumption, until you reach a contradiction: two facts that cannot both hold. — since correct reasoning cannot produce an impossibility, the assumption must have been wrong, so the original statement is true.
The delicate part is the very first move: negating the statement precisely. “ is irrational” negates to “ is rational”. “There are infinitely many primes” negates to “there are finitely many primes”. Get the negation slightly wrong and the whole proof is aimed at the wrong target.
Contradiction is what you reach for when the direct route is blocked. It is hard to build a positive thing out of “irrational” or “infinitely many” — but easy to assume the tidy opposite (“rational”, “finite list”) and then squeeze it until it breaks.
A warm-up: if $n^2$ is even, then $n$ is even
This small result is worth proving on its own, and we will need it for . A direct proof is awkward, so we use contradiction — or equivalently, we prove the contrapositive.
Assume the statement is false: suppose is even but is . Then we can write for some integer . Squaring, , which is odd. But we assumed is even. A number cannot be both even and odd — contradiction. So cannot be odd; it must be even.
Tip — The same argument shows: if is a multiple of 3, then is a multiple of 3. That version powers the proof that is irrational.
The headline proof: $\sqrt{2}$ is irrational
This is one of the most famous proofs in all of mathematics, and AQA can ask for it directly. Follow every line — the structure is the lesson.
Example 1Prove that is irrational.
The “lowest terms” assumption is the trap that springs the contradiction. By insisting and share no factor at the start, we guarantee that discovering they are both even is an impossibility — not just an inconvenience.
The other named proof: infinitely many primes
Euclid proved this around 300 BC, and it is a masterpiece of contradiction. The idea: assume the primes run out, then build a number that no prime on the list can divide.
Example 1Prove that there are infinitely many prime numbers.
itself need not be prime — the argument never claims it is. All that matters is that must have prime factor, and that factor cannot be any prime on the supposedly-complete list.
Think like an examiner
- The opening line is worth a mark on its own: write “ …” with the correct negation of the statement before anything else.
- For , you must state that is in (no common factor) — the entire contradiction depends on it.
- Name the contradiction explicitly: “ and share a factor of 2, contradicting lowest terms”, or “ has a prime factor not on the list”. Do not leave the examiner to spot it.
- For the primes proof, do not claim is prime — say only that it must have a prime factor. That is a classic place students lose the final mark.
- Close by returning to the original statement: “therefore is irrational”.
Common misconceptions
The two named results
Stretch yourself
Adapt the argument to prove that is irrational. Which lemma do you need, and where does the contradiction come from?
Hint — You need “if is a multiple of 3, then is a multiple of 3.” Start from in lowest terms.
Reveal solution
Questions students ask
How is proof by contradiction different from disproof by counter-example?
Why does the proof insist the fraction is in lowest terms?
In the primes proof, is always prime?
How do I know when to use contradiction rather than a direct proof?
Key takeaways
- Assume the statement is false, reason to an impossibility, and conclude it must be true.
- The first and most error-prone step is negating the statement correctly.
- Lemma: if is even then is even — proved by contradiction, and reused in the √2 proof.
- irrational: assume in lowest terms; force and both even; contradiction.
- Infinitely many primes: assume a finite list; build ; it needs a prime factor off the list.
How this fits the course
Related
- Surds and Rationalisingsoon
- Disproof by Counter-Example
Leads to
- Algebra and Functionssoon
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.
A proof by contradiction begins by:
- assuming the statement is false
- assuming the statement is true
- testing several examples
- listing all cases
Show answer and explanation
Answer: assuming the statement is false
You assume the negation, then derive an impossibility from it.
The correct negation of “there are infinitely many primes” is:
- there are finitely many primes
- there are no primes
- there is exactly one prime
- all numbers are prime
Show answer and explanation
Answer: there are finitely many primes
The opposite of “infinitely many” is “finitely many”, i.e. a finite complete list.
In the proof, assuming in lowest terms leads to:
- and are both even, contradicting lowest terms
- is prime
Show answer and explanation
Answer: and are both even, contradicting lowest terms
forces even, then even — but a lowest-terms fraction cannot have both even.
Why must be even once we know ?
- Because is even, and if is even then is even
- Because is a multiple of
- Because all squares are even
- Because
Show answer and explanation
Answer: Because is even, and if is even then is even
This is exactly the lemma proved earlier in the lesson.
In Euclid’s proof, the number is used because:
- no prime on the list divides it (each leaves remainder 1)
- it is always prime
- it is always even
- it equals the largest prime
Show answer and explanation
Answer: no prime on the list divides it (each leaves remainder 1)
Dividing by any listed prime leaves remainder 1, so its prime factor is not on the list.
A contradiction is reached when you derive:
- two facts that cannot both be true
- a surprising but valid result
- a large number
- an example that works
Show answer and explanation
Answer: two facts that cannot both be true
An impossibility (e.g. a number both even and odd) signals the assumption was false.
Proof by contradiction is most useful for statements about:
- irrationality or infinity, where a direct proof is hard
- small finite sets of numbers
- disproving universal claims
- differentiating functions
Show answer and explanation
Answer: irrationality or infinity, where a direct proof is hard
Assuming the tidy opposite (rational, finite) gives something concrete to work with.
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 6 lessons- Same chapterThe Structure of a Mathematical ProofWhat a proof actually is: statements, conditions, the logic symbols ⇒, ⇐ and ⇔, and the standard number sets.
- Same chapterProof by DeductionProving a result for all cases with a chain of algebra that starts from definitions. This is the method most A-Level proof questions expect.
- Same chapterProof by ExhaustionSplitting a statement into every possible case and checking each one, and knowing when that approach is valid.
Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.