olymmath

TSTST 2025 Problem 4

    Let n≥2n \geq 2 be a positive integer. Let a1,a2,…,ana_1, a_2, \ldots, a_n be a sequence of positive integers such that

    gcd⁡(a1,a2), gcd⁡(a2,a3), …, gcd⁡(an−1,an)\gcd(a_1, a_2),\ \gcd(a_2, a_3),\ \ldots,\ \gcd(a_{n-1}, a_n)

    is a strictly increasing sequence. Find, in terms of nn, the maximum possible value of

    1a1+1a2+⋯+1an\frac{1}{a_1} + \frac{1}{a_2} + \cdots + \frac{1}{a_n}

    over all such sequences.

    Official text USA TST for the TST 2025 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 tstst/2025/p4 · Tag VX6RRQTRS0 · Edit this page on GitHub · Keys: j next, k previous