olymmath

OMM 1998 Problem 1

    A number is called lucky if computing the sum of the squares of its digits and repeating this operation sufficiently many times leads to number 11 . For example, 19001900 is lucky, as 1900→82→68→100→11900 \to 82 \to 68 \to 100 \to 1 . Find infinitely many pairs of consecutive numbers each of which is lucky.

    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 mx-omm/1998/p1 · Tag KB2NFXND3W · Edit this page on GitHub · Keys: j next, k previous