All worksheets topics

Structure of proof and proof by exhaustionEdexcel International A Level Maths: Subtopic test

10 questions, 27 marks

Edexcel International A Level Maths

Structure of proof and proof by exhaustion

Total 27 marks

Name

Class

Date

  1. 1
    A statement S is made: for every integer nn with 1≤n≤51\le n\le5, the value of n2+nn^2+n is even.
    (a)
    Which of the following is needed for a proof by exhaustion of S?
    [1 mark]
    • AShowing that S is true for n=3n=3 only
    • BShowing that S is true for each of n=1,2,3,4,5n=1,2,3,4,5
    • CFinding one value of nn for which S is true
    • DShowing that S is true for n=1n=1 and n=5n=5, and assuming the values in between must also work
    (b)
    Find the value of n2+nn^2+n when n=4n=4.
    [1 mark]
    • A1616
    • B1212
    • C2525
    • D2020
    (c)
    Prove that S is true by exhaustion.
    [2 marks]

    Total for question 1: 4 marks

  2. 2
    xx and yy are odd positive integers, each less than 7.
    (a)
    How many different ordered pairs (x,y)(x,y) are possible?
    [1 mark]
    • A33
    • B66
    • C99
    • D2727
    (b)
    Which of the following is a possible value of x+yx+y?
    [1 mark]
    • A1010
    • B77
    • C1212
    • D99
    (c)
    Prove that x+yx+y is divisible by 22 for every possible pair.
    [2 marks]

    Total for question 2: 4 marks

  3. 3
    Let f(n)=n3−nf(n)=n^3-n, where nn is an integer.
    (a)
    Use proof by exhaustion to show that f(n)f(n) is divisible by 66 for every integer nn with 2≤n≤62\le n\le6.
    [3 marks]
    (b)
    A student claims that f(n)f(n) is divisible by 1212 for every integer nn with 2≤n≤62\le n\le6. Test this claim, and explain what your result shows about proof by exhaustion.
    [4 marks]

    Total for question 3: 7 marks

  4. 4
    Maya tests two statements about integers by checking every case. A calculator may be used.
    (a)
    Statement 1: for every odd integer nn with 3≤n≤93\le n\le9, n2−1n^2-1 is divisible by 88. (i) Use proof by exhaustion to prove Statement 1. (ii) Explain why this does not prove that n2−1n^2-1 is divisible by 88 for every odd integer nn.
    [6 marks]
    (b)
    Statement 2: n2+n+11n^2+n+11 is prime for every integer nn with 0≤n≤100\le n\le10. Use proof by exhaustion to determine whether Statement 2 is true or false. Justify your answer fully.
    [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).