olymmath

Nemotron-IMO-Bench 2026 N35

    Prove that for any integer n>1n>1 there are only finitely many nn-tuples of positive integers (a1,a2,...,an)(a_1,a_2,...,a_n) such that a1>a2>...>ana_1>a_2>...>a_n, gcd⁡(a1,a2,...,an)=1\gcd(a_1,a_2,...,a_n)=1 and a1=gcd⁡(a1,a2)+gcd⁡(a2,a3)+...+gcd⁡(an−1,an)+gcd⁡(an,a1).a_1=\gcd(a_1,a_2)+\gcd(a_2,a_3)+...+\gcd(a_{n-1},a_n)+\gcd(a_n,a_1).

    Dataset text Nemotron-IMO-Bench. Open licence.

    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 nemotron-imo-bench/2026/n35 · Tag JG21BCD7BD · Edit this page on GitHub · Keys: j next, k previous