olymmath

AT-OEMO-FED1 2005 Problem 1

    Prove that there are infinitely many multiples of 2005 that contain all the digits 0, 1, 2,...,9 an equal number of times.

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