The Fibonacci sequence is defined as:
Fib(1) = 0
Fib(2) = 1
Fib(N) = Fib(N-1) + Fib(N-2)
The Fibonacci sequence can be generalized as follows:
Fib_gen(1) = a
Fib_gen(2) = b
Fib_gen(N) = Fib_gen(N-1) + Fib_gen(N-2)
where 0 <= a <= b
Moreover it can be shown that
Fib_gen(N) = k(1) * Fib(N) + k(2) * Fib(N+1)
Given a and b find k(1) and k(2).
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers50
Suggested Problems
-
Back to basics 6 - Column Vector
1105 Solvers
-
Solve the set of simultaneous linear equations
494 Solvers
-
Create a vector whose elements depend on the previous element
787 Solvers
-
Sum of first n positive integers
622 Solvers
-
Find out value of sine given by degree.
355 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
It is true that Fib_gen(N) = k(1) * Fib(N) + k(2) * Fib(N+1) for some k, but the problem is actually requesting Fib_gen(N) = k(2) * Fib(N) + k(1) * Fib(N-1) for another k. If one is still in doubt, generate the two sequences and look at the expected answer.