olymmath

OME 2003 Problem 1

    Prove that for any prime p{p} , different than 2{2} and 5{5} , there exists such a multiple of p{p} whose digits are all nines. For example, if p=13{p = 13} , such a multiple is 999999=13∗76923{999999 = 13 * 76923} .

    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 es-ome/2003/p1 · Tag HBRWMATG8X · Edit this page on GitHub · Keys: j next, k previous