olymmath

KöMaL 2017 C1432

    Let nn be a positive integer. Show that there exists an nn-digit number that is divisible by 2n2^n, and only contains digits of 1 and 2.

    Official text KöMaL. 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 hu-komal/2017/c1432 · Tag TVFG7QNCWD · Edit this page on GitHub · Keys: j next, k previous