Date | May 2018 | Marks available | 8 | Reference code | 18M.3dm.hl.TZ0.5 |
Level | HL only | Paper | Paper 3 Discrete mathematics | Time zone | TZ0 |
Command term | Use and Prove that | Question number | 5 | Adapted from | N/A |
Question
The Fibonacci sequence can be described by the recurrence relation fn+2=fn+1+fn where f0=0,f1=1.
Write down the auxiliary equation and use it to find an expression for fn in terms of n.
It is known that α2=α+1 where α=1+√52.
For integers n ≥ 3, use strong induction on the recurrence relation fn+2=fn+1+fn to prove that fn>αn−2.
Markscheme
attempt to find the auxiliary equation (λ2−λ−1=0) M1
λ=1±√52 (A1)
the general solution is fn=A(1+√52)n+B(1−√52)n (M1)
imposing initial conditions (substituting n = 0,1) M1
A + B = 0 and A(1+√52)+B(1−√52)=1 A1
A=1√5,B=−1√5 A1
fn=1√5(1+√52)n−1√5(1−√52)n A1
Note: Condone use of decimal numbers rather than exact answers.
[7 marks]
let P(n) be fn>αn−2 for integers n ≥ 3
consideration of two consecutive values of f R1
f3=2 and α3−2=1+√52(1.618…)⇒P(3) is true A1
f4=3 and α4−2=3+√52(2.618…)⇒P(4) is true A1
Note: Do not award A marks for values of n other than n = 3 and n = 4.
(for k ≥ 4), assume that P(k) and P(k − 1) are true M1
required to prove that P(k + 1) is true
Note: Accept equivalent notation. Needs to start with 2 general consecutive integers and then prove for the next integer. This will affect the powers of the alphas.
fk+1=fk+fk−1 (and fk>αk−2,fk−1>αk−3) M1
fk+1>αk−2+αk−3=αk−3(α+1) A1
=αk−3α2=αk−1=α(k+1)−2 A1
as P(3) and P(4) are true, and P(k) , P(k − 1) true ⇒ P(k + 1) true then P(k) is true for k ≥ 3 by strong induction R1
Note: To obtain the final R1, at least five of the previous marks must have been awarded.
[8 marks]