Solve Fibonacci recursion relation
Not what you're looking for?
Solve the recurrence relation
x_(n+1) = x_n + x_(n-1), x_0 = 1, x_1 = 1.
That it, find a formula for x_n in terms of n
Purchase this Solution
Solution Preview
Solution analogous to Ordinary Differential Equation (ODE):
There is a "not-quite a typo" in initial conditions, which can lead to contradictions, as we shall see below.
Otherwise, the ODE works well, as follows.
We seek solution in an exponential form x =a^(n+k), where a and k are constants.
We shall find "a" from the ...
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.