Theory of Numbers : Fibonacci Number
Not what you're looking for?
Suppose that F1 = 1, F2 = 1, F3 =1, F4 = 3, F5 = 5, and in general Fn = Fn-1 + Fn-2 for n ≥ 3 ( Fn is called the nth Fibonacci number.) Prove that F1 + F2 + F3 +...+ Fn = F(n + 2) - 1
Purchase this Solution
Solution Summary
Fibonacci numbers are investigated. The solution is detailed and well presented.
Education
- BSc, Manipur University
- MSc, Kanpur University
Recent Feedback
- "Thanks this really helped."
- "Sorry for the delay, I was unable to be online during the holiday. The post is very helpful."
- "Very nice thank you"
- "Thank you a million!!! Would happen to understand any of the other tensor problems i have posted???"
- "You are awesome. Thank you"
Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Probability Quiz
Some questions on probability
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts