Edexcel International A Level Maths
Structure of proof and proof by exhaustion
Total 27 marks
Name
Class
Date
- 1A statement S is made: for every integer with , the value of is even.(a)Which of the following is needed for a proof by exhaustion of S?[1 mark]
- AShowing that S is true for only
- BShowing that S is true for each of
- CFinding one value of for which S is true
- DShowing that S is true for and , and assuming the values in between must also work
Show the mark scheme
Mark scheme
Answer: B(b)Find the value of when .[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: D(c)Prove that S is true by exhaustion.[2 marks]Show the mark scheme
Mark scheme
M1: evaluates for all five values , giving
A1: all five values are even, so S is true for every in the range
Accept: evaluated for each
Do not accept: checking only some of the valuesTotal for question 1: 4 marks
- 2and are odd positive integers, each less than 7.(a)How many different ordered pairs are possible?[1 mark]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: C(b)Which of the following is a possible value of ?[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: A(c)Prove that is divisible by for every possible pair.[2 marks]Show the mark scheme
Mark scheme
M1: lists every possible value of and () and all the sums:
A1: each sum is divisible by 2, so the statement is true in every case
Accept: a table of all nine ordered pairs, or the six unordered pairs
Do not accept: checking only some pairsTotal for question 2: 4 marks
- 3Let , where is an integer.(a)Use proof by exhaustion to show that is divisible by for every integer with .[3 marks]
Show the mark scheme
Mark scheme
M1: evaluates for each of
A1: all correct
B1: each is divisible by 6 (quotients ) and a conclusion that the statement is true in every case
Accept: used to find each value(b)A student claims that is divisible by for every integer with . Test this claim, and explain what your result shows about proof by exhaustion.[4 marks]Show the mark scheme
Mark scheme
M1: checks the values for divisibility by 12
A1: identifies a failing case: or is not divisible by 12
B1: the claim is false
B1: proof by exhaustion needs the statement to hold in every case, so one failing case is enough to show a claim false
Accept: follow-through from (a)Total for question 3: 7 marks
- 4Maya tests two statements about integers by checking every case. A calculator may be used.(a)Statement 1: for every odd integer with , is divisible by . (i) Use proof by exhaustion to prove Statement 1. (ii) Explain why this does not prove that is divisible by for every odd integer .[6 marks]
Show the mark scheme
Mark scheme
M1: (i) lists all four cases
A1: (i)
A1: (i) each is a multiple of 8 ()
B1: (i) conclusion that the statement is true in every case
B1: (ii) proof by exhaustion covers only the finite list of cases checked
B1: (ii) there are infinitely many odd integers, so values such as have not been checked(b)Statement 2: is prime for every integer with . Use proof by exhaustion to determine whether Statement 2 is true or false. Justify your answer fully.[6 marks]Show the mark scheme
Mark scheme
M1: evaluates for each of
A1:
B1: the values for to are all prime, with a reason for the larger ones (e.g. is not divisible by or )
M1: identifies that gives
A1: , so it is not prime
B1: the statement is false, because it fails for
Accept:Total for question 4: 12 marks
End of questions