olymmath

BALKAN-SL 2008 A3

    Let (am)(a_m) be a sequence satisfying an≥0a_n \geq 0 , n=0,1,2,…n=0,1,2,\ldots Suppose there exists A>0A >0 , am−am+1a_m - a_{m+1} ≥Aam2\geq A a_m ^2 for all m≥0m \geq 0 . Prove that there exists B>0B>0 such that \begin{align*} a_n \le \frac{B}{n} \text{for }1 \le n \end{align*}

    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 balkan-sl/2008/a3 · Tag TRWJ59PHHM · Edit this page on GitHub · Keys: j next, k previous