Proof by contradictionAQA A-Level Maths: Mind map
Method
Negation
Irrational roots
Proof by contradiction
assume the opposite
negationcontradictionconclude
Primes
Unfamiliar
Exam tips
Exam questions on Proof by contradiction
- A student wishes to prove by contradiction that is irrational.Given that and is a multiple of , complete the proof that is irrational.2 marks
- Claim: there are no positive integers and such that .Complete the proof that no such integers exist.2 marks
- Euclid's proof that there are infinitely many prime numbers begins by assuming that there are only finitely many, say , and then considers the number .Show that leaves remainder when divided by each of , and state what this means for the divisibility of .3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).