Cody

Problem 2187. Generalized Fibonacci

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

83.78% Correct | 16.22% Incorrect
Last solution submitted on Jul 19, 2017

Problem Comments

Tags

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!