olymmath

KURSCHAK 2013 Problem 1

    Let a,ba,b be positive real numbers satisfying 2ab=a−b2ab=a-b . Denote for any positive integer kk xkx_k and yky_k to be the closest integer to akak and bkbk , respectively (if there are two closest integers, choose the larger one). Prove that any positive integer nn appears in the sequence (xk)k≥1(x_k)_{k\ge 1} if and only if it appears at least three times in the sequence (yk)k≥1(y_k)_{k\ge 1} .

    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 kurschak/2013/p1 · Tag 8DVAWKHQ7E · Edit this page on GitHub · Keys: j next, k previous