Date | May 2016 | Marks available | 1 | Reference code | 16M.1.hl.TZ0.6 |
Level | HL only | Paper | 1 | Time zone | TZ0 |
Command term | Conjecture | Question number | 6 | Adapted from | N/A |
Question
Consider the recurrence relation Hn+1=2Hn+1, n∈Z+ where H1=1.
Find H2, H3 and H4.
Conjecture a formula for Hn in terms of n, for n∈Z+.
Prove by mathematical induction that your formula is valid for all n∈Z+.
Markscheme
H2=2H1+1 (M1)
=3; H3=7; H4=15 A1
[2 marks]
Hn=2n−1 A1
[1 mark]
let P(n) be the proposition that Hn=2n−1 for n∈Z+
from (a) H1=1=21−1 A1
so P(1) is true
assume P(k) is true for some k⇒Hk=2k−1 M1
then Hk+1=2Hk+1 (M1)
=2×(2k−1)+1 A1
=2k+1−1
P(1) is true and P(k) is true ⇒P(k+1) is true, hence P(n) is true for all n∈Z+ by the principle of mathematical induction R1
Note: Only award the R1 if all earlier marks have been awarded.
[5 marks]
Examiners report
This was a successful question for many candidates with many wholly correct answers seen. The vast majority of candidates were able to answer parts (a) and (b) and most knew how to start part (c). A few candidates were let down by not realising the need for a degree of formality in the presentation of the inductive proof.
This was a successful question for many candidates with many wholly correct answers seen. The vast majority of candidates were able to answer parts (a) and (b) and most knew how to start part (c). A few candidates were let down by not realising the need for a degree of formality in the presentation of the inductive proof.
This was a successful question for many candidates with many wholly correct answers seen. The vast majority of candidates were able to answer parts (a) and (b) and most knew how to start part (c). A few candidates were let down by not realising the need for a degree of formality in the presentation of the inductive proof.