olymmath

CMO 1998 Problem 5

  • Paper

Let mm be a positive integer. Define the sequence a0,a1,a2,⋯a_0, a_1, a_2, \cdots by a0=0,a1=m,a_0 = 0, a_1 = m, and an+1=m2an−an−1a_{n+1} = m^2a_n - a_{n-1} for n=1,2,3,⋯n = 1,2,3,\cdots . Prove that an ordered pair (a,b)(a,b) of non-negative integers, with a≤ba \leq b , gives a solution to the equation a2+b2ab+1=m2{ \frac{a^2 + b^2}{ab + 1} = m^2} if and only if (a,b)(a,b) is of the form (an,an+1)(a_n,a_{n+1}) for some n≥0n \geq 0 .

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/1998/p5 · Tag FA97NFR6N3 · Edit this page on GitHub · Keys: j next, k previous