Skip to main content
OlympiadHQ

Browse · MathNet

Print

Team selection tests for IMO 2018

Saudi Arabia 2018 algebra

Problem

with is the Fibonacci sequence, which defined as . Suppose that on the range , the function takes on the maximum value at . Prove that .
Solution
We will prove that by showing that for all , there is some for which .

Indeed, if then which is obvious.

Suppose that for then put , we choose . We need Each side has 3030 positive factors then we will make pair one of the left and one of the right such that the value of the right is bigger (except the case then ). For details:

1. If , it is clearly that .

2. If , we have . Note that we just consider the separated ranges, i.e. . Otherwise, some ranges are overlap then we remove that part, then Hence, the statement is proved. From here, we have It is easy to check that then substitute into the above inequality, we get .

Techniques

Recurrence relationsExponential functionsJensen / smoothing