Home Competitions KöMaL 2005 B3817
The sequence a n a_n a n is defined as follows: a 1 ≠ a_1 \ne a 1 = 2, a 2 = a 1 a 1 − 2 a_2=\frac{a_1}{a_1-2} a 2 = a 1 − 2 a 1 , a n + 1 = n a n 2 n a n 2 − ( n + 1 ) a n + ( n + 1 ) a_{n+1}=\frac{na_n^2}{na_n^2-(n+1)a_n+(n+1)} a n + 1 = n a n 2 − ( n + 1 ) a n + ( n + 1 ) n a n 2 , if n ≥ n \ge n ≥ 2. Prove that the inequality a 1 a_1 a 1 +2a 2 a_2 a 2 +3a 3 a_3 a 3 +...+n a n na_n n a n =a 1 . a 2 . a 3 . . . . . a n a_1 ^. a_2 ^. a_3 ^. ...^. a_n a 1 . a 2 . a 3 . .. . . a n is true for all n n n .
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/2005/b3817 · Tag QV4G028Z29 · Edit this page on GitHub · Keys: j next, k previous