olymmath

ELMO 2019 Problem 1

    Let P(x)P(x) be a polynomial with integer coefficients such that P(0)=1P(0)=1 , and let c>1c > 1 be an integer. Define x0=0x_0=0 and xi+1=P(xi)x_{i+1} = P(x_i) for all integers i≥0i \ge 0 . Show that there are infinitely many positive integers nn such that gcd⁡(xn,n+c)=1\gcd (x_n, n+c)=1 .

    Proposed by Milan Haiman and Carl Schildkraut

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: ELMO 2019 official paper, page 1.

    Also ELMO SL 2019 N1.

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