CMO 1986 Problem 5
- Paper
Let , , , be a sequence of integers satisfying the recurrence relation . Suppose and . Prove that 1986 divides infinitely many terms of the sequence.
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.