olymmath

KöMaL 2008 B4072

    Let SS(nn) denote the sum of the digits of the natural number nn. Prove that there are infinitely many natural numbers nn not ending in 0, such that SS(n2n^2)=SS(nn).

    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/2008/b4072 · Tag 2CWXABCKJB · Edit this page on GitHub · Keys: j next, k previous