Loading [MathJax]/jax/output/CommonHTML/fonts/TeX/fontdata.js

User interface language: English | Español

Date May 2017 Marks available 4 Reference code 17M.3dm.hl.TZ0.4
Level HL only Paper Paper 3 Discrete mathematics Time zone TZ0
Command term Verify Question number 4 Adapted from N/A

Question

Consider the recurrence relation aun+2+bun+1+cun=0, nN where a, b and c are constants. Let α and β denote the roots of the equation ax2+bx+c=0.

Verify that the recurrence relation is satisfied by

un=Aαn+Bβn,

where A and B are arbitrary constants.

[4]
a.

Solve the recurrence relation

un+22un+1+5un=0 given that u0=0 and u1=4.

[9]
b.

Markscheme

attempt to substitute the given expression for un into the recurrence relation     M1

aun+2+bun+1+cun=a(Aαn+2+Bβn+2)+b(Aαn+1+Bβn+1)+c(Aαn+Bβn)     A1

=Aαn(aα2+bα+c)+Bβn(aβ2+bβ+c)     A1

=0 because α and β both satisfy ax2+bx+c=0     R1AG

 

Note:     Award M1A0A1R0 for solutions that are set to zero throughout and conclude with 0=0. Award the R1 for any valid reason.

 

[4 marks]

a.

the auxiliary equation is x22x+5=0     A1

solving their quadratic equation     (M1)

the roots are 1±2i     A1

the general solution is

un=A(1+2i)n+B(12i)n(un=(5)n(Acis(narctan2)+Bcis(narctan2)))    (A1)

attempt to substitute both boundary conditions     M1

A+B=0; A(1+2i)+B(12i)=4     A1

attempt to solve their equations for A and B     M1

A=i, B=i     A1

un=i(12i)ni(1+2i)n(un=2(5)nsin(narctan2))     A1

 

Note:     Accept the trigonometric form for un.

 

[9 marks]

b.

Examiners report

[N/A]
a.
[N/A]
b.

Syllabus sections

Topic 10 - Option: Discrete mathematics » 10.11

View options