olymmath

CZ-SK-MO 2006 Problem 1

    Define a sequence of positive integers {an}\{a_n\} through the recursive formula: an+1=an+bn(n≥1)a_{n+1}=a_n+b_n(n\ge 1) ,where bnb_n is obtained by rearranging the digits of ana_n (in decimal representation) in reverse order (for example,if a1=250a_1=250 ,then b1=52,a2=302b_1=52,a_2=302 ,and so on). Can a7a_7 be a prime?

    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 cz-sk-mo/2006/p1 · Tag YAM86KSJZ5 · Edit this page on GitHub · Keys: j next, k previous