Core Pure: Proof

Core Pure: Proof topic test

Edexcel A-Level Further Maths: covers all 1 subtopics

Studying this course? Keep your progress in one place.

Two ways to do this test

Question by question

One question at a time. Each answer is marked the moment you hand it in, so you learn as you go. Drago helps if you get stuck. All 20 questions, or just 5.

Exam mode

The whole paper in one go, timed like the real exam. Nothing is marked until you hand it in, then you get every mark explained.

20 questions, 54 marks

Edexcel A-Level Further Maths

Core Pure: Proof topic test

Total 54 marks

Name

Class

Date

  1. 1
    Proof by mathematical induction is to be used to show that ∑r=1nr3=14n2(n+1)2\sum_{r=1}^{n}r^3=\frac14n^2(n+1)^2 for all positive integers nn.
    (a)
    What is the value of the left-hand side when n=3n=3?
    [1 mark]
    • A2727
    • B3636
    • C216216
    • D1414
    (b)
    Assuming the result is true for n=kn=k, which expression is equal to ∑r=1k+1r3\sum_{r=1}^{k+1}r^3?
    [1 mark]
    • A14k2(k+1)2+k3\frac14k^2(k+1)^2+k^3
    • B14k2(k+1)2+(k+1)\frac14k^2(k+1)^2+(k+1)
    • C14k2(k+1)2+(k+1)3\frac14k^2(k+1)^2+(k+1)^3
    • D14(k+1)2(k+2)2+(k+1)3\frac14(k+1)^2(k+2)^2+(k+1)^3
    (c)
    Show that if the result is true for n=kn=k then it is true for n=k+1n=k+1.
    [2 marks]

    Total for question 1: 4 marks

  2. 2
    The function g(n)=8n+13\mathrm{g}(n)=8^n+13 is defined for positive integers nn.
    (a)
    Find g(2)\mathrm{g}(2).
    [1 mark]
    • A7777
    • B2929
    • C2121
    • D6464
    (b)
    Which expression is equal to g(k+1)−g(k)\mathrm{g}(k+1)-\mathrm{g}(k)?
    [1 mark]
    • A8k8^k
    • B9×8k9\times8^k
    • C8k+1+138^{k+1}+13
    • D7×8k7\times8^k
    (c)
    Given that g(k)\mathrm{g}(k) is divisible by 7 for some positive integer kk, show that g(k+1)\mathrm{g}(k+1) is also divisible by 7.
    [2 marks]

    Total for question 2: 4 marks

  3. 3
    The matrix C=(2−110)\mathbf{C}=\begin{pmatrix}2&-1\\1&0\end{pmatrix}.
    (a)
    Find C2\mathbf{C}^2 and C3\mathbf{C}^3, and hence suggest a formula for Cn\mathbf{C}^n.
    [3 marks]
    (b)
    Prove by induction that your formula for Cn\mathbf{C}^n is correct for all positive integers nn.
    [4 marks]

    Total for question 3: 7 marks

  4. 4
    Throughout this question, nn is a positive integer and every proof must state the inductive assumption and end with a conclusion.
    (a)
    Prove by induction that ∑r=1nr×r!=(n+1)!−1\sum_{r=1}^{n}r\times r!=(n+1)!-1.
    [6 marks]
    (b)
    The matrix R=(2302)\mathbf{R}=\begin{pmatrix}2&3\\0&2\end{pmatrix}. Prove by induction that Rn=(2n3n×2n−102n)\mathbf{R}^n=\begin{pmatrix}2^n&3n\times2^{n-1}\\0&2^n\end{pmatrix}.
    [6 marks]

    Total for question 4: 12 marks

  5. 5
    Proof by mathematical induction is to be used to show that ∑r=1nr(r+1)(r+2)=14n(n+1)(n+2)(n+3)\sum_{r=1}^{n}r(r+1)(r+2)=\frac14n(n+1)(n+2)(n+3) for all positive integers nn.
    (a)
    What is the value of the right-hand side of the formula when n=2n=2?
    [1 mark]
    • A2424
    • B66
    • C120120
    • D3030
    (b)
    Which expression is the right-hand side of the formula with n=k+1n=k+1?
    [1 mark]
    • A14(k+1)(k+2)(k+3)(k+4)\frac14(k+1)(k+2)(k+3)(k+4)
    • B14k(k+1)(k+2)(k+3)+1\frac14k(k+1)(k+2)(k+3)+1
    • C14(k+1)(k+2)(k+3)\frac14(k+1)(k+2)(k+3)
    • D14k(k+2)(k+3)(k+4)\frac14k(k+2)(k+3)(k+4)
    (c)
    Show that if the result is true for n=kn=k then it is true for n=k+1n=k+1.
    [2 marks]

    Total for question 5: 4 marks

  6. 6
    Let h(n)=7n−3n\mathrm{h}(n)=7^n-3^n, where nn is a positive integer.
    (a)
    Find h(2)\mathrm{h}(2).
    [1 mark]
    • A88
    • B4040
    • C44
    • D5858
    (b)
    Which expression is equal to h(k+1)−7h(k)\mathrm{h}(k+1)-7\mathrm{h}(k)?
    [1 mark]
    • A−10×3k-10\times3^k
    • B−4×3k-4\times3^k
    • C4×3k4\times3^k
    • D4×7k4\times7^k
    (c)
    Given that h(k)\mathrm{h}(k) is divisible by 4 for some positive integer kk, show that h(k+1)\mathrm{h}(k+1) is also divisible by 4.
    [2 marks]

    Total for question 6: 4 marks

  7. 7
    A sequence is defined by u1=1u_1=1 and un+1=2un+3u_{n+1}=2u_n+3 for n⩾1n\geqslant1.
    (a)
    Find u2u_2, u3u_3 and u4u_4, and show that each agrees with the formula un=2n+1−3u_n=2^{n+1}-3.
    [3 marks]
    (b)
    Prove by induction that un=2n+1−3u_n=2^{n+1}-3 for all positive integers nn.
    [4 marks]

    Total for question 7: 7 marks

  8. 8
    Throughout this question, nn is a positive integer and each result must be proved by mathematical induction.
    (a)
    Prove that f(n)=2n+2+32n+1\mathrm{f}(n)=2^{n+2}+3^{2n+1} is divisible by 7.
    [6 marks]
    (b)
    Prove that ∑r=1nr2r=2−n+22n\sum_{r=1}^{n}\frac{r}{2^r}=2-\frac{n+2}{2^n}.
    [6 marks]

    Total for question 8: 12 marks

End of questions

Topic tests