TUYMAADA 2006 Problem 2
We call a sequence of integers a Fibonacci-type sequence if it is infinite in both ways and for any . How many Fibonacci-type sequences can we find, with the property that in these sequences there are two consecutive terms, strictly positive, and less or equal than ? (two sequences are considered to be the same if they differ only by shifting of indices)
Proposed by I. Pevzner
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.