Example 1
Fibonacci numbers
0, 1, 1, 2, 3, 5, 8, 13, 21, ... Fn=Fn−1+Fn−2 for n≥2withF0=0
Homogenous Recurrence Relations 齐次递推关系
In general
an−c1an−1−c2an−2−…−ckan−k=0
with a0=A0,a1=A1,…,ak−1=Ak−1(initial condition)
This is k-th order linear homogenous recurrence relation with constant coefficients.(HRR)
常系数k阶线性齐次递推关系。
or k-th order linear homogenous difference equation with constant coeffcients.(HRE)
或常数系数的k阶线性齐次差分方程。
Example 2
Solve an1−5an+6an−1=0 for n≥2 with a1=1,a2=5.
Try an=rn.
then rn+1−5rn+6rn−1=0
then rn−1(r2−5r+6)=0
then r2−5r+6=0 (characteristic equation)
then r=2,3
hence both an=2n and an=3n are solutions.
Since the equation is linear an=α12n+α23nis also a solution for any constants α1 and α2
so an=α12n+α23n is the general solution.
For initial conditions,
1=a1=2α1+3α2
5=a2=4α1+9α2
so α1=−1,α2=1
so an=−2n+3n for n≥1
Example 3
Solve Fn−Fn−1−Fn−2=0 for n≥2 with F0=0,F1=1.
characteristic equation
r2−r−1=0
r=21±5
then General solution=α1(21+5)n+α2(21−5)n
For initial conditions
0=F0=α1+α2
1=F1=α1(21+5)+α2(21−5)
so α1=51,α2=−51
so Fn=51[(21+5)n−(21−5)n] for n≥0