olymmath

MEMO 2023 T8

    Let AA and BB be positive integers. Consider a sequence of positive integers (xn)n≥1(x_n)_{n \geq 1} such that

    xn+1=A⋅gcd⁡(xn,xn−1)+Bfor every n≥2.x_{n+1} = A \cdot \gcd(x_n, x_{n-1}) + B \quad \text{for every } n \geq 2.

    Prove that the sequence attains only finitely many different values.

    Remark. We denote by gcd⁡(a,b)\gcd(a, b) the greatest common divisor of positive integers aa and bb.

    Official text Middle European Mathematical Olympiad 2023 official paper, page 2. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

    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 memo/2023/t8 · Tag ZXRWWBV2V3 · Edit this page on GitHub · Keys: j next, k previous