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 k in that domain, then use that assumption to prove it for k+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)/2, add k+1 to the assumed result: k(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 n?
For n=1, the left side is 1(2)=2 and the right side is 1(2)(3)/3=2.
Assume the result holds for a positive integer k: r=1∑kr(r+1)=3k(k+1)(k+2).
Then r=1∑k+1r(r+1)=3k(k+1)(k+2)+(k+1)(k+2)=(k+1)(k+2)(3k+1)=3(k+1)(k+2)(k+3). This is the required expression for n=k+1. The base case and inductive step establish the statement for every positive integer n.
Verifies the base case.
[1 mark]
States the induction assumption.
[1 mark]
Adds the correct next term.
[1 mark]
Simplifies to the required expression for k+1.
[1 mark]
Makes a valid induction conclusion.
[1 mark]
Q20 · Practice questionComplex familiar5 marks
QUESTION 20 (5 marks)
Use mathematical induction to prove that 8n−2n is divisible by 6 for every positive integer n.
Assume 8k−2k=6m for some integer m. Then 8k+1−2k+1=8(8k−2k)+6⋅2k=48m+6⋅2k=6(8m+2k). Since 8m+2k is an integer, the expression is divisible by 6. By induction, the result holds for every positive integer n.