olymmath

OIM 2009 Problem 5

    Consider the sequence {an}n≥1\{a_n\}_{n\geq1} defined as follows: a1=1a_1 = 1 , a2k=1+aka_{2k} = 1 + a_k and a2k+1=1a2ka_{2k + 1} = \frac {1}{a_{2k}} for every k≥1k\geq 1 . Prove that every positive rational number appears on the sequence {an}\{a_n\} exactly once.

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