olymmath

KöMaL 2009 B4167

    For every positive integer nn, let ff(nn) denote the number obtained by reversing the order of digits in the decimal form of nn. (For example, ff(2500)=52, ff(1456)=6541.) Find all positive integers kk, such that for any multiple nn of kk, kk also divides the number ff(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/2009/b4167 · Tag HDZ1VMEFJN · Edit this page on GitHub · Keys: j next, k previous