QCEVault

Proof and induction practice

QCE Specialist Maths · Original practice questions with worked solutions

Practise proving a statement for every allowed integer. Keep the base case, inductive assumption and inductive implication separate.

Key ideas

  • Check the first allowed integer explicitly. State the domain of the proposition.
  • Assume the statement holds for an arbitrary integer kk in that domain, then use that assumption to prove it for k+1k+1.
  • Finish by stating why the base case and implication establish the result for all allowed integers.

Worked example

To prove 1+⋯+n=n(n+1)/21+\cdots+n=n(n+1)/2, add k+1k+1 to the assumed result: k(k+1)/2+(k+1)=(k+1)(k+2)/2k(k+1)/2+(k+1)=(k+1)(k+2)/2.

A common mistake

Verifying several examples does not prove the statement for every integer.

Try these questions

Attempt each question before revealing the worked solution. Saved questions and checked answers also appear in the main bank on this device. Exam marks are recorded after marking a practice exam.

Q4 · Practice questionSimple familiar1 mark

QUESTION 4

Which expression is divisible by 5 for every positive integer nn?

(A)
5n−15^n-1
(B)
4n−14^n-1
(C)
22n−12^{2n}-1
(D)
6n−16^n-1
Question link
Q18 · Practice questionComplex familiar5 marks

QUESTION 18 (5 marks)

Use mathematical induction to prove that ∑r=1nr(r+1)=n(n+1)(n+2)3\sum_{r=1}^n r(r+1)=\frac{n(n+1)(n+2)}3 for every positive integer nn.
Question link
Q20 · Practice questionComplex familiar5 marks

QUESTION 20 (5 marks)

Use mathematical induction to prove that 8n−2n8^n-2^n is divisible by 6 for every positive integer nn.
Question link

All proof and induction practice questions

17 original questions · Page 1 of 1

  1. Q4 · Original practice · 1 mark
    Original Specialist Mathematics practice question 4: induction and divisibility
    Proof and induction
  2. Q18 · Original practice · 5 marks
    Use mathematical induction to prove that ∑r=1nr(r+1)=n(n+1)(n+2)3\sum_{r=1}^n r(r+1)=\frac{n(n+1)(n+2)}3 for every positive integer nn.
    Proof and induction
  3. Q20 · Original practice · 5 marks
    Use mathematical induction to prove that 8n−2n8^n-2^n is divisible by 6 for every positive integer nn.
    Proof and induction
  4. Q21 · Original practice · 1 mark
    In proving 1+3+⋯+(2n−1)=n21+3+\cdots+(2n-1)=n^2 by induction, the left side for n=k+1n=k+1 becomes
    Proof and induction
  5. Q22 · Original practice · 6 marks
    View question and marking material
    Proof and induction
  6. Q23 · Original practice · 1 mark
    Assume 7k−17^k-1 is divisible by 6. Which rearrangement is most useful for the inductive step?
    Proof and induction
  7. Q25 · Original practice · 1 mark
    Using De Moivre’s theorem, sin⁡(3x)=3sin⁡x−4sin⁡3x\sin(3x)=3\sin x-4\sin^3x. The coefficient of sin⁡3x\sin^3x is
    Proof and induction
  8. Q154 · Original practice · 7 marks
    A sequence of partial sums is defined by
    Sn=∑k=1nk(k+1)!,n∈Z+.S_n=\sum_{k=1}^{n}\frac{k}{(k+1)!},\qquad n\in\mathbb Z^+.
    Here m!m! denotes the factorial of the positive integer mm.
    Mathematical induction
  9. Q178 · Original practice · 6 marks
    Consider (cos⁡θ+isin⁡θ)4(\cos\theta+i\sin\theta)^4.
    Mathematical induction and trigonometric proofs
  10. Q179 · Original practice · 6 marks
    For positive integers n, let Sn=∑k=1n(2k−1)3S_n=\sum_{k=1}^n(2k-1)^3.
    Mathematical induction and trigonometric proofs
  11. Q180 · Original practice · 6 marks
    For positive integers n, consider 8n−18^n-1.
    Mathematical induction and trigonometric proofs
  12. Q181 · Original practice · 6 marks
    A programmable light display contains k2kk2^k lights in row k, for k=1,…,nk=1,\ldots,n.
    Mathematical induction and trigonometric proofs
  13. Q182 · Original practice · 1 mark
    A student checks that n2+n+41n^2+n+41 is prime for n=0,…,39n=0,\ldots,39 and claims it is prime for every nonnegative integer. Which statement is correct?
    Mathematical induction and trigonometric proofs
  14. Q253 · Original practice · 13 marks
    A game has centre c=(1,−1)\mathbf c=(1,-1) and checkpoints p0=c+(8,0)\mathbf p_0=\mathbf c+(8,0), pn+1=c+A(pn−c)\mathbf p_{n+1}=\mathbf c+A(\mathbf p_n-\mathbf c), where A=14(1−331)A=\frac14\begin{pmatrix}1&-\sqrt3\\\sqrt3&1\end{pmatrix}. A player visits the checkpoints in order along straight segments. Coordinates are in metres. You may use ∑n=0∞rn=1/(1−r)\sum_{n=0}^\infty r^n=1/(1-r) for ∣r∣<1|r|<1.
    Mathematical induction and trigonometric proofs
  15. Q266 · Original practice · 6 marks
    Let θ∈R\theta\in\mathbb R. The angle addition identities may be used.
    Mathematical induction and trigonometric proofs
  16. Q267 · Original practice · 6 marks
    Consider (cos⁡θ+isin⁡θ)4(\cos\theta+i\sin\theta)^4.
    Mathematical induction and trigonometric proofs
  17. Q292 · Original practice · 1 mark
    A student verifies a proposition for n=1, then proves that if it holds for n=k, it holds for n=k+2. What can this establish without another base case?
    Mathematical induction and trigonometric proofs