olymmath

KöMaL 2006 B3880

    Prove that every positive integer nn has a (positive) multiple smaller than n2n^2, such that in decimal notation it does not contain all the ten different digits.

    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/2006/b3880 · Tag PZJ73JPFMB · Edit this page on GitHub · Keys: j next, k previous