olymmath

IMAC 2007 Problem 1

    Let (fn)n≥0(f_n) _{n\ge 0} be the sequence defined by f0=0,f1=1,fn+2=fn+1+fnf_0 = 0, f_1 = 1, f_{n + 2 }= f_{n + 1} + f_n for n>0n> 0 (Fibonacci string) and let tn=t_n = (n+12){n+1}\choose{2} for n≥1n \ge 1 . Prove that: a) f12+f22+...+fn2=fn⋅fn+1f_1^2+f_2^2+...+f_n^2 = f_n \cdot f_{n+1} for n≥1n \ge 1 b) 1n2⋅Σk=1n(tkfk)2≥tn+129fn⋅fn+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}}

    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