Loading [MathJax]/jax/output/CommonHTML/jax.js

User interface language: English | Español

Date None Specimen Marks available 9 Reference code SPNone.1.hl.TZ0.13
Level HL only Paper 1 Time zone TZ0
Command term Obtain Question number 13 Adapted from N/A

Question

A sequence {un} satisfies the recurrence relation un+2=2un+15un , nN . Obtain an expression for un in terms of n given that u0=0 and u1=1 .

Markscheme

the auxiliary equation is m22m+5=0    M1

the roots are 1±2i    A1

the general solution is un=A(1+2i)n+B(12i)n     A1

substituting u0=0 and u1=1     M1

A+B=0

A(1+2i)+B(12i)=1     A1

Note: Only award above A1 if both equations are correct.

 

solving

A(1+2i1+2i)=1     (M1)

A=14i or i4     A1

B=14i or i4     A1

therefore

un=14i(1+2i)n14i(12i)n or i4(12i)ni4(1+2i)n     A1

[9 marks]

Examiners report

[N/A]

Syllabus sections

Topic 6 - Discrete mathematics » 6.11 » Recurrence relations. Initial conditions, recursive definition of a sequence.

View options