Solution. Apply induction on n n n . Considering the empty product as 1, we have equality for n = 0 n=0 n = 0 .
Now assume that the statement is true for some n n n and prove it for n + 1 n+1 n + 1 . For n + 1 n+1 n + 1 , the statement can be written as the sum of the inequalities
1 + 1 a 0 ( 1 + 1 a 1 − a 0 ) ⋯ ( 1 + 1 a n − a 0 ) ≤ ( 1 + 1 a 0 ) ⋯ ( 1 + 1 a n ) 1+\frac1{a_0}\left(1+\frac1{a_1-a_0}\right)\cdots\left(1+\frac1{a_n-a_0}\right)\le\left(1+\frac1{a_0}\right)\cdots\left(1+\frac1{a_n}\right) 1 + a 0 1 ( 1 + a 1 − a 0 1 ) ⋯ ( 1 + a n − a 0 1 ) ≤ ( 1 + a 0 1 ) ⋯ ( 1 + a n 1 )
(which is the induction hypothesis) and
1 a 0 ( 1 + 1 a 1 − a 0 ) ⋯ ( 1 + 1 a n − a 0 ) ⋅ 1 a n + 1 − a 0 ≤ ( 1 + 1 a 0 ) ⋯ ( 1 + 1 a n ) ⋅ 1 a n + 1 . (1) \frac1{a_0}\left(1+\frac1{a_1-a_0}\right)\cdots\left(1+\frac1{a_n-a_0}\right)\cdot\frac1{a_{n+1}-a_0}\le\left(1+\frac1{a_0}\right)\cdots\left(1+\frac1{a_n}\right)\cdot\frac1{a_{n+1}}. \tag{1} a 0 1 ( 1 + a 1 − a 0 1 ) ⋯ ( 1 + a n − a 0 1 ) ⋅ a n + 1 − a 0 1 ≤ ( 1 + a 0 1 ) ⋯ ( 1 + a n 1 ) ⋅ a n + 1 1 . ( 1 )
Hence, to complete the solution it is sufficient to prove (1).
To prove (1), apply a second induction. For n = 0 n=0 n = 0 , we have to verify
1 a 0 ⋅ 1 a 1 − a 0 ≤ ( 1 + 1 a 0 ) 1 a 1 . \frac1{a_0}\cdot\frac1{a_1-a_0}\le\left(1+\frac1{a_0}\right)\frac1{a_1}. a 0 1 ⋅ a 1 − a 0 1 ≤ ( 1 + a 0 1 ) a 1 1 .
Multiplying by
a 0 a 1 ( a 1 − a 0 ) a_0a_1(a_1-a_0) a 0 a 1 ( a 1 − a 0 ) , this is equivalent with
a 1 ≤ ( a 0 + 1 ) ( a 1 − a 0 ) a 0 ≤ a 0 a 1 − a 0 2 1 ≤ a 1 − a 0 . \begin{gathered}
a_1\le(a_0+1)(a_1-a_0)\\
a_0\le a_0a_1-a_0^2\\
1\le a_1-a_0.
\end{gathered} a 1 ≤ ( a 0 + 1 ) ( a 1 − a 0 ) a 0 ≤ a 0 a 1 − a 0 2 1 ≤ a 1 − a 0 .
For the induction step it is sufficient that
( 1 + 1 a n + 1 − a 0 ) ⋅ a n + 1 − a 0 a n + 2 − a 0 ≤ ( 1 + 1 a n + 1 ) ⋅ a n + 1 a n + 2 . \left(1+\frac1{a_{n+1}-a_0}\right)\cdot\frac{a_{n+1}-a_0}{a_{n+2}-a_0}\le\left(1+\frac1{a_{n+1}}\right)\cdot\frac{a_{n+1}}{a_{n+2}}. ( 1 + a n + 1 − a 0 1 ) ⋅ a n + 2 − a 0 a n + 1 − a 0 ≤ ( 1 + a n + 1 1 ) ⋅ a n + 2 a n + 1 .
Multiplying by
( a n + 2 − a 0 ) a n + 2 (a_{n+2}-a_0)a_{n+2} ( a n + 2 − a 0 ) a n + 2 ,
( a n + 1 − a 0 + 1 ) a n + 2 ≤ ( a n + 1 + 1 ) ( a n + 2 − a 0 ) a 0 ≤ a 0 a n + 2 − a 0 a n + 1 1 ≤ a n + 2 − a n + 1 . \begin{gathered}
(a_{n+1}-a_0+1)a_{n+2}\le(a_{n+1}+1)(a_{n+2}-a_0)\\
a_0\le a_0a_{n+2}-a_0a_{n+1}\\
1\le a_{n+2}-a_{n+1}.
\end{gathered} ( a n + 1 − a 0 + 1 ) a n + 2 ≤ ( a n + 1 + 1 ) ( a n + 2 − a 0 ) a 0 ≤ a 0 a n + 2 − a 0 a n + 1 1 ≤ a n + 2 − a n + 1 .
Remark 1. It is easy to check from the solution that equality holds if and only if a k + 1 − a k = 1 a_{k+1}-a_k=1 a k + 1 − a k = 1 for all k k k .
Remark 2. The statement of the problem is a direct corollary of the identity
1 + ∑ i = 0 n ( 1 x i ∏ j ≠ i ( 1 + 1 x j − x i ) ) = ∏ i = 0 n ( 1 + 1 x i ) . 1+\sum_{i=0}^n\left(\frac1{x_i}\prod_{j\ne i}\left(1+\frac1{x_j-x_i}\right)\right)=\prod_{i=0}^n\left(1+\frac1{x_i}\right). 1 + i = 0 ∑ n x i 1 j = i ∏ ( 1 + x j − x i 1 ) = i = 0 ∏ n ( 1 + x i 1 ) .
Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 1–2. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.