olymmath

CN-SMO 2021 Problem 1

    A sequence {an}\{a_n\} is defined recursively by a1=12,a_1=\frac{1}{2}, and for n≥2,n\ge 2, 0<an≤an−10<a_n\leq a_{n-1} and an2(an−1+1)+an−12(an+1)−2anan−1(anan−1+an+1)=0.a_n^2(a_{n-1}+1)+a_{n-1}^2(a_n+1)-2a_na_{n-1}(a_na_{n-1}+a_n+1)=0. (1)(1) Determine the general formula of the sequence {an};\{a_n\}; (2)(2) Let Sn=a1+⋯+an.S_n=a_1+\cdots+a_n. Prove that for n≥1,n\ge 1, ln⁡(n2+1)<Sn<ln⁡(n+1).\ln\left(\frac{n}{2}+1\right)<S_n<\ln(n+1).

    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 cn-smo/2021/p1 · Tag CGD6JGYJ3E · Edit this page on GitHub · Keys: j next, k previous