Problem 2187. Generalized Fibonacci

Created by Daniel lefebvre

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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).

Solve

Solution Stats

101 Solutions
49 Solvers

Last Solution submitted on Oct 30, 2024

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Rafael S.T. Vieira on 4 Sep 2020

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.

Solution Comments

Show comments

ANNOUNCEMENT

Join Cody Contest 2025 — Have Fun and Win Prizes!

We’re excited to invite you to Cody Contest 2025! 🎉 Pick a team,...

Problem Recent Solvers49

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!