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

72.55% Correct | 27.45% Incorrect
Last solution submitted on Jun 17, 2019

Problem Comments

Recent Solvers29

Suggested Problems

Tags