olymmath

CMO 1986 Problem 5

  • Paper

Let u1u_1 , u2u_2 , u3u_3 , …\dots be a sequence of integers satisfying the recurrence relation un+2=un+12−unu_{n + 2} = u_{n + 1}^2 - u_n . Suppose u1=39u_1 = 39 and u2=45u_2 = 45 . 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.

Add a solution

Similar problems

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

Locator ca-cmo/1986/p5 · Tag 61GTJC46DZ · Edit this page on GitHub · Keys: j next, k previous