Find the largest positive integer n for which the inequality abc+1a+b+c+nabc≤25 holds for all a,b,c∈[0,1]. Here 1abc=abc.
This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.
Solution: Let nmax be the sought largest value of n, and let Ea,b,c(n)=abc+1a+b+c+nabc. Then Ea,b,c(m)−Ea,b,c(n)=mabc−nabc and since abc≤1 we clearly have Ea,b,c(m)≥Ea,b,c(n) for m≥n. So if Ea,b,c(n)≥25 for some choice of a,b,c∈[0,1], it must be nmax≤n. We use this remark to determine the upper bound nmax≤3 by plugging some particular values of a,b,c into the given inequality as follows: For (a,b,c)=(1,1,c),c∈[0,1],inequality (1) implies c+1c+2+nc≤25⇔c+11+nc≤23. Obviously, every x∈[0,1] is written as nc for some c∈[0,1]. So the last inequality is equivalent to: ⇔⇔xn+11+x≤23⇔2+2xn+1+2x≤3xn+3⇔3xn+1≥2xn+1+2x2xn(1−x)+(1−x)+(x−1)(xn−1+⋯+x)≥0(1−x)[2xn+1−(xn−1+xn−2+…+x)]≥0,∀x∈[0,1] For n=4, the left hand side of the above becomes (1−x)(2x4+1−x3−x2−x)=(1−x)(x−1)(2x3+x2−1)=−(1−x)2(2x3+x2−1) which for x=0.9 is negative. Thus, nmax≤3 as claimed.
Now, we shall prove that for n=3 inequality (1) holds for all a,b,c∈[0,1], and this would mean nmax=3. We shall use the following Lemma:
Lemma. For all a,b,c∈[0,1]:a+b+c≤abc+2.
Proof of the Lemma: The required result comes by adding the following two inequalities side by side 0≤(a−1)(b−1)⇔a+b≤ab+1⇔a+b−ab≤10≤(ab−1)(c−1)⇔ab+c≤abc+1 Because of the Lemma, our inequality (1) for n=3 will be proved if the following weaker inequality is proved for all a,b,c∈[0,1]: abc+1abc+2+3abc≤25⇔abc+11+3abc≤23 Denoting 3abc=y∈[0,1], this inequality becomes: ⇔y3+11+y≤23⇔2+2y4+2y≤3y3+3⇔−2y4+3y3−2y+1≥02y3(1−y)+(y−1)y(y+1)+(1−y)≥0⇔(1−y)(2y3+1−y2−y)≥0 The last inequality is obvious because 1−y≥0 and 2y3+1−y2−y=y3+(y−1)2(y+1)≥0.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.