olymmath

ÖMO 2018 Problem 6

    Determine all digits zz such that for each integer k≥1k \ge 1 there exists an integer n≥1n\ge 1 with the property that the decimal representation of n9n^9 ends with at least kk digits zz .

    (Proposed by Walther Janous)

    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 at-oemo/2018/p6 · Tag DXF92CRMEH · Edit this page on GitHub · Keys: j next, k previous