olymmath

NL-NWO 1997 Problem 1

    For each positive integer nn we define f(n)f (n) as the product of the sum of the digits of nn with nn itself. Examples: f(19)=(1+9)×19=190f (19) = (1 + 9) \times 19 = 190 , f(97)=(9+7)×97=1552f (97) = (9 + 7) \times 97 = 1552 . Show that there is no number nn with f(n)=19091997f (n) = 19091997 .

    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 nl-nwo/1997/p1 · Tag QZWYHSR1EH · Edit this page on GitHub · Keys: j next, k previous