olymmath

ELMO 2017 Problem 1

    Let a1,a2,…,ana_1,a_2,\dots, a_n be positive integers with product P,P, where nn is an odd positive integer. Prove that gcd⁡(a1n+P,a2n+P,…,ann+P)≤2gcd⁡(a1,…,an)n.\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n. Proposed by Daniel Liu

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: ELMO 2017 official paper, page 1.

    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 elmo/2017/p1 · Tag JDJVBVDZ7P · Edit this page on GitHub · Keys: j next, k previous