I think those can be deduced from the basic recurrence relation . If you start substituting on the left-hand side, the right-hand side comes out pretty quickly in both cases.
Post again in this thread if you're still having trouble.
Would the formulas
and for n=0,1,2,...
necessarily remain true if the sequence Fn was replaced by a sequence with the same recurrence relation as the Fibonacci sequence but different initial terms? Justify your answer briefly.
I'm not sure, but would the formula remain true, but with different initial terms the sequence would have different numbers? I'm not quite sure how to tackle this. Thanks for any pointers.
These are essentially the same formula. If you add to both sides of the first formula, you get so , which is the second formula with n replaced by by n-1 (i.e. all three subscripts decreased by 1).
But let's take your two formulas and do some algebra:
adding to the first gives:
and substituting into the second gives:
and subtracting from both sides gives:
.
That's the second formula you were looking for.
Now, if you take:
and instead of substituting for , you substitute for using , you get:
, which is the first formula you were looking for.
- Hollywood
So presumably the formulas would remain true if the sequence Fn was replaced by a sequence with the same recurrence relation as the Fibonacci sequence but different initial terms, and that is proved by replacing the initial term
with F_{n+3}+F_{n}=2F_{n+2}[/tex] and F_{n+3}-F_{n}=2F_{n+1}[/tex]