olymmath

AUSTRIAN-POLISH 2003 Problem 2

    The sequence a0,a1,a2,..a_0, a_1, a_2, .. is defined by a0=a,an+1=an+L(an)a_0 = a, a_{n+1} = a_n + L(a_n) , where L(m)L(m) is the last digit of mm (eg L(14)=4L(14) = 4 ). Suppose that the sequence is strictly increasing. Show that infinitely many terms must be divisible by d=3d = 3 . For what other d is this true?

    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/2003/p2 · Tag X2S1N25J7R · Edit this page on GitHub · Keys: j next, k previous