Proof by contradictionEdexcel International A Level Maths: Subtopic test
10 questions, 27 marks
Edexcel International A Level Maths
Proof by contradiction
Total 27 marks
Name
Class
Date
- 1A student begins a proof by contradiction that is irrational.(a)Which assumption should the proof begin with?[1 mark]
- A is irrational
- B, where and are integers with no common factor other than 1 and
- C is an integer
- D, where and are both even
(b)The assumption leads to . Which deduction follows directly?[1 mark]- A is a prime number
- B is even and is odd
- C and are both odd
- D is even, so is even
(c)Given that and so is even, complete the proof.[2 marks]Total for question 1: 4 marks
- 2Euclid's proof that there are infinitely many primes begins by assuming that there are only finitely many primes, . Let .(a)What is the remainder when is divided by any one of the primes ?[1 mark]
- A
- B
- C
- D
(b)Which conclusion completes the argument?[1 mark]- A must itself be prime
- B is divisible by every
- C has a prime factor that is not in the list, contradicting the assumption that the list contains every prime
- D
(c)A student takes the first six primes, , so . Show that is not prime, and state what this shows about Euclid's argument.[2 marks]Total for question 2: 4 marks
- 3In a proof by contradiction you assume that the statement is false and show that this leads to an impossible result.(a)Prove by contradiction that there are no integers and such that .[3 marks](b)Prove by contradiction that is irrational.[4 marks]
Total for question 3: 7 marks
- 4Use proof by contradiction in each part. You may use the fact that is irrational.(a)Prove that is irrational.[6 marks](b)Prove that the equation has no solutions in which and are both integers.[6 marks]
Total for question 4: 12 marks
End of questions
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).