olymmath

MK-MO 2022 Problem 1

    Let (xn)n=1∞(x_n)_{n=1}^\infty be a sequence defined recursively with: x1=2x_1=2 and xn+1=xn(xn+n)n+1x_{n+1}=\frac{x_n(x_n+n)}{n+1} for all n≥1n \ge 1 . Prove that n(n+1)>(x1+x2+…+xn)2xn+1.n(n+1) >\frac{(x_1+x_2+ \ldots +x_n)^2}{x_{n+1}}. Proposed by Nikola Velov

    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 mk-mo/2022/p1 · Tag 2Z1WN2J7XB · Edit this page on GitHub · Keys: j next, k previous