A-level · Proof
Proof by contradictionExam-style questions
Assuming the opposite of what you want to prove, deriving a logical contradiction, and concluding the original must be true. Negating a statement correctly, the classic results (√2 is irrational), and why reaching an actual contradiction is the whole point. (A-level / Year 2.)
31 questions · A-level level · mark scheme and worked solution on each · no sign-up to try
- 1(a) Prove that the square of any odd integer is more than a multiple of .
(2 marks)
(b) Hence, or otherwise, use proof by contradiction to show that the equation has no solutions in which and are both integers.
(3 marks)Level 4 · 5 marksTry it - 2A student is using proof by contradiction to show that, for all integers ,
“if is a multiple of , then is a multiple of ”
The student's working so far is shown below.
Suppose that is an integer for which is a multiple of but is not a multiple of
When , where ,
, which is more or less than a multiple of
(a) Show the calculations and statements that are needed to complete the proof.
(3 marks)
(b) Hence use proof by contradiction to show that is irrational.
(5 marks)Level 4 · 8 marksTry it - 3Use proof by contradiction to show that there is no greatest even integer.Level 4 · 3 marksTry it
- 4Use proof by contradiction to prove that is irrational.Level 4 · 5 marksTry it
- 5Use proof by contradiction to show that the sum of a rational number and an irrational number is irrational.Level 4 · 3 marksTry it
9 more questions on proof by contradiction
Free with an account — just an email, no card. The whole bank, every mark scheme and worked solution.