olymmath

AUSTRIAN-POLISH 1982 Problem 4

    Let P(x)P(x) denote the product of all (decimal) digits of a natural number xx . For any positive integer x1x_1 , define the sequence (xn)(x_n) recursively by xn+1=xn+P(xn)x_{n+1} = x_n + P(x_n) . Prove or disprove that the sequence (xn)(x_n) is necessarily bounded.

    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 austrian-polish/1982/p4 · Tag EJ5JKJJZV2 · Edit this page on GitHub · Keys: j next, k previous