olymmath

US-EGMO-TST 2026 Problem 4

    For a positive integer nn, let cnc_n be the smallest possible value of max⁡(a,b)\max(a, b) over all pairs of distinct positive integers aa and bb such that

    lcm⁡(a,b)+k=lcm⁡(a+k,b+k)\operatorname{lcm}(a, b) + k = \operatorname{lcm}(a + k, b + k)

    for all 0≤k≤n0 \le k \le n. Find all positive integers nn for which cn=cn+1c_n = c_{n+1}.

    Official text USA EGMO Team Selection Test 2026 official paper, page 2. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/claude@2.1.318 (claude-opus-5-5). 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 us-egmo-tst/2026/p4 · Tag 80KGAS9DK6 · Edit this page on GitHub · Keys: j next, k previous