A-level · Proof
Proof by exhaustionExam-style questions
Proving a statement by splitting it into a finite, complete set of cases and checking every one — either a short list of values, or all integers split by parity or remainder. Why the cases must leave no gaps, and why exhaustion only works when the cases really are finite.
6 questions · A-level level · mark scheme and worked solution on each · no sign-up to try
- 1The positive integers and satisfy
Prove, by exhaustion, that is always a prime number.
The table below may be used to set out your cases. You do not have to fill every row.
(3 marks)Level 2 · 3 marksTry it - 2Ayesha is using proof by exhaustion to show that, for every integer ,
is a multiple of 3
Her proof so far is shown in the box below.
Complete Ayesha's proof.Ayesha's proof Every integer can be written in one of the forms , or , where is an integer. When : , which is a multiple of 3
(4 marks)Level 3 · 4 marksTry it - 3In this question you must show detailed reasoning.
The integer is not a multiple of 3
Prove by exhaustion, using algebra, that
is a multiple of 3
(4 marks)Level 3 · 4 marksTry it - 4Prove that is divisible by for every integer , by exhausting the possible remainders of on division by .Level 3 · 4 marksTry it
- 5(a) By writing in terms of its remainder on division by , prove that, for every integer , the remainder when is divided by is , or .
(4 marks)
(b) The integers , and are each chosen at random from the set , independently of one another.
Determine the probability that is divisible by .
(4 marks)Level 4 · 8 marksTry it
1 more question on proof by exhaustion
Free with an account — just an email, no card. The whole bank, every mark scheme and worked solution.