Fibonacci sequence in closed form
Not what you're looking for?
Prove that Fn can be expressed by:
Fn=[(a^n-b^n)/(a-b)] for n=1,2,3...
~: Set Gn=[(a^n-b^n)/(a-b)] and show that Gn satisfies the recurrence formula {G(n+1) = Gn + G(n-1) for n=2,3,4...} and don't forget that a and b satisfy the equation x^2-x-1=0.
a and b are the roots of x^2-x-1=0, which are (1+sqrt5)/2 and (1-sqrt5)/2.
Purchase this Solution
Solution Summary
The Fibonacci sequence in closed forms are given. The recurrence relation is examined.
Solution Preview
Please see attached file.
This can be easily proved by Mathematical Induction:
We show that the recurrence relationship holds for n = 2 and n=3 by direct substitution:
At n =1 , G(1) =
At n = 2, G(2) = = a + b = 1 (plugging in a ...
Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Probability Quiz
Some questions on probability
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts