olymmath

VN-TST 2005 Problem 6

    nn is called diamond 2005 if n=...ab999...99999cd...‾n=\overline{...ab999...99999cd...} , e.g. 2005×92005 \times 9 . Let {an}:an<C⋅n,{an}\{a_n\}:a_n< C\cdot n,\{a_n\} is increasing. Prove that {an}\{a_n\} contain infinite diamond 2005.

    Compare with this problem.

    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 vn-tst/2005/p6 · Tag VJC3VSG08V · Edit this page on GitHub · Keys: j next, k previous