![]() |
Problem
of the Week |
PROBLEM 226
A sequence x1, x2, x3,... is called Fibonacci-like if it satisfies the property: xk+ xk+1 = xk+2, for k ≥ 1. The classic Fibonacci sequence is Fibonacci-like with initial condition x1= 1, x2 = 1, leading to the sequence 1,1,2,3,5,8,13,21,34,...; the Lucas numbers are Fibonacci-like with initial condition x1= 1, x2 = 3, leading to the sequence 1,3,4,7,11,18,29,47,76,... .
Which Fibonacci-like sequence is the longest before seeing the term 2005?
You are visitor number
2697
to this page.
ã2005 Alberto L. Delgado