Home Competitions IMAC 2007 Problem 1
Let ( f n ) n ≥ 0 (f_n) _{n\ge 0} ( f n ) n ≥ 0 be the sequence defined by f 0 = 0 , f 1 = 1 , f n + 2 = f n + 1 + f n f_0 = 0, f_1 = 1, f_{n + 2 }= f_{n + 1} + f_n f 0 = 0 , f 1 = 1 , f n + 2 = f n + 1 + f n for n > 0 n> 0 n > 0 (Fibonacci string)
and let t n = t_n = t n = ( n + 1 2 ) {n+1}\choose{2} ( 2 n + 1 ) for n ≥ 1 n \ge 1 n ≥ 1 . Prove that:
a) f 1 2 + f 2 2 + . . . + f n 2 = f n ⋅ f n + 1 f_1^2+f_2^2+...+f_n^2 = f_n \cdot f_{n+1} f 1 2 + f 2 2 + ... + f n 2 = f n ⋅ f n + 1 for n ≥ 1 n \ge 1 n ≥ 1 b) 1 n 2 ⋅ Σ k = 1 n ( t k f k ) 2 ≥ t n + 1 2 9 f n ⋅ f n + 1 \frac{1}{n^2} \cdot \Sigma_{k=1}^{n}\left( \frac{t_k}{f_k}\right)^2 \ge \frac{t_{n+1}^2}{9 f_n \cdot f_{n+1}} n 2 1 ⋅ Σ k = 1 n ( f k t k ) 2 ≥ 9 f n ⋅ f n + 1 t n + 1 2
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 imac/2007/p1 · Tag VER5CDEDNC · Edit this page on GitHub · Keys: j next, k previous