olymmath

ELMO SL 2017 N3

    For each integer C>1C>1 decide whether there exist pairwise distinct positive integers a1,a2,a3,...a_1,a_2,a_3,... such that for every k≥1k\ge 1 , ak+1ka_{k+1}^k divides Cka1a2...akC^ka_1a_2...a_k .

    [i]Proposed by Daniel Liu

    Dataset text AI-MO AoPS. Quoted with source.

    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-sl/2017/n3 · Tag 6D60MZHRJK · Edit this page on GitHub · Keys: j next, k previous