olymmath

TUYMAADA 2006 Problem 2

    We call a sequence of integers a Fibonacci-type sequence if it is infinite in both ways and an=an−1+an−2a_{n}=a_{n-1}+a_{n-2} for any n∈Zn\in\mathbb{Z} . 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 NN ? (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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator tuymaada/2006/p2 · Tag 2BJCN6RR22 · Edit this page on GitHub · Keys: j next, k previous