olymmath

KöMaL 2017 B4883

    Define the sequence a1,a2,…a_1, a_2, \dots with the following recurrence relation: a1=4,a2=2andan+1=nan2nan2−(n+1)an+n+1, if n≥2.a_1=4, a_2=2 \text{and} a_{n+1}=\frac{na_n^2}{na_n^2-(n+1)a_n+n+1}, \text{ if } n\ge 2. Prove that a1+2⋅a2+3⋅a3+⋯+n⋅an=a1⋅a2⋅a3⋅ ⋯⋅ana_1+2\cdot a_2+3\cdot a_3+\cdots +n\cdot a_n=a_1\cdot a_2\cdot a_3\cdot\,\cdots \cdot a_n for all n≥1n\ge 1.

    Official text KöMaL. 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 hu-komal/2017/b4883 · Tag F41C3ZACZC · Edit this page on GitHub · Keys: j next, k previous