MathDB
0431 Fibonacci inequality 4th edition Round 3 p1

Source:

May 7, 2021
algebra4th edition

Problem Statement

Let {fn}n1\{f_n\}_{n\ge 1} be the Fibonacci sequence, defined by f1=f2=1f_1 = f_2 = 1, and for all positive integers nn, fn+2=fn+1+fnf_{n+2} = f_{n+1} + f_n. Prove that the following inequality takes place for all positive integers nn: (n1)f1+(n2)f2+...+(nn)fn<(2n+2)nn!{n \choose 1}f_1 +{n \choose 2}f_2+... +{n \choose n}f_n < \frac{(2n + 2)^n}{n!} .