This post is a follow on from an earlier post, titled Solving Linear Recurrence Relations of June 16th 2020, in which I dealt only with polynomials having real roots. Here I look at an example of a polynomial with one real root and two complex roots.
Suppose we have the following recurrence:an=an−1−an−2+an−3 with a0=1,a2=2,a3=3This corresponds to x3=x2−x+1 and thus we can write:
P(x)=x3−x2+x−1=x2(x−1)+1(x−1)=(x2+1)(x−1)with solutions of x=1,±i when P(x)=0. The n-th term can be written as a linear combination of these three solutions and thus:an=A⋅(1)n+B⋅in+C⋅(−i)n with A,B,C constants We apply the initial conditions then to find the values of A,B,C by creating three equations in the three unknowns:A+B+C=1 when n=0A+Bi−Ci=2 when n=1A−B−C=3 when n=2Solving these we find that:A=25B=−i+210C=i−210This means that an is then given by:an=2n+2−in((i+2)−(i−2)(−1)n)10This satisfies the original conditions and will generate all terms: 0, 1, 2, 3, 6, 13, 26, 51, 102, 205, 410, 819, 1638, 3277, 6554, 13107, 26214, 52429, 104858, 209715, 419430, 838861, 1677722, ...
Even though the formula contains i's, they always cancel out to produce real numbers. My interest in this topic was rekindled when I looked at my diurnal age (26200) and found that it could be generated by the following linear homogenous recurrence:a(n)=a(n−1)+a(n−3) with a(0)=3,a(1)=1,a(2)=4 and n≥3This lead to a polynomial with one real root and two complex roots, namely:P(x)=x3−x2−0⋅x−1=x3−x2−1However, the roots are nasty and so I chose to deal with a simpler but similar polynomial in this post.
To see how the terms of the first sequencean=an−1−an−2+an−3 can be generated from the initial valuesa0=1,a2=2,a3=3or from the formula for the n-th terman=2n+2−in((i+2)−(i−2)(−1)n)10follow this SageMathCell permalink. Clearly, we also have:limn→∞an+1an=2
No comments:
Post a Comment