VMO 1989 Problem 2
Let = 1, = 1, = + be the Fibonacci sequence. Show that there are infinitely many terms of the sequence such that + + 1960 is divisible by 1989. Does there exist a term such that + + 1960 + 2 is divisible by 1989?
Community text Kalva (prase.cz mirror). 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.