ramsey2879
- 841
- 3
Has anyone seen this before? It must have been noted before!
Let c = a+b and d = ab Then the series S_{n} = c*S_{n-1} - d*S_{n-2} having the values 2 and c for S_0 and S_1 has the explicit formula
S_{n} = a^{n} + b^{n}.
Proof
The Explicit formula for the above recursive series is found by finding the roots e and f of the equation u^{2} - c*u + d = 0 and solving the set of equations:
2 = A + B and
c = Ae + Bf from which we determine that
S_{n} = Ae^{n} + Bf^{n}
We need to show that A = B = 1, e = a and f = b.
Now e,f = (c +/- Sq root[(c)^{2} - 4ab])/2 = (a+b +/- (a-b))/2 = a,b
Solving the set of equations we also see that A=B=1. Q.E.D.
Most likely the proof could be done by induction also, but I wanted to focus on the general theory of recursive series.
Let c = a+b and d = ab Then the series S_{n} = c*S_{n-1} - d*S_{n-2} having the values 2 and c for S_0 and S_1 has the explicit formula
S_{n} = a^{n} + b^{n}.
Proof
The Explicit formula for the above recursive series is found by finding the roots e and f of the equation u^{2} - c*u + d = 0 and solving the set of equations:
2 = A + B and
c = Ae + Bf from which we determine that
S_{n} = Ae^{n} + Bf^{n}
We need to show that A = B = 1, e = a and f = b.
Now e,f = (c +/- Sq root[(c)^{2} - 4ab])/2 = (a+b +/- (a-b))/2 = a,b
Solving the set of equations we also see that A=B=1. Q.E.D.
Most likely the proof could be done by induction also, but I wanted to focus on the general theory of recursive series.
Last edited: