Olympiad Maths Prep

Track / Stage 7 / 64 of 300 #1464 of 2000

Problem 1464

National olympiad second round; IMO P1/P4
Algebra Difficulty 7.1 Find the answer

Let nn be a positive integer. Positive numbers aa, bb, cc satisfy 1a+1b+1c=1\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=1. Find the greatest possible value of E(a,b,c)=ana2n+1+b2nc+bc2n+bnb2n+1+c2na+ca2n+cnc2n+1+a2nb+ab2nE(a,b,c)=\frac{a^{n}}{a^{2n+1}+b^{2n} \cdot c + b \cdot c^{2n}}+\frac{b^{n}}{b^{2n+1}+c^{2n} \cdot a + c \cdot a^{2n}}+\frac{c^{n}}{c^{2n+1}+a^{2n} \cdot b + a \cdot b^{2n}}

Official solution

To find the greatest possible value of
E(a,b,c)=ana2n+1+b2nc+bc2n+bnb2n+1+c2na+ca2n+cnc2n+1+a2nb+ab2n, E(a,b,c) = \frac{a^n}{a^{2n+1} + b^{2n}c + bc^{2n}} + \frac{b^n}{b^{2n+1} + c^{2n}a + ca^{2n}} + \frac{c^n}{c^{2n+1} + a^{2n}b + ab^{2n}},
we start by using the given condition:
1a+1b+1c=1. \frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1.

1. Applying the AM-GM Inequality:
By the Arithmetic Mean-Geometric Mean (AM-GM) inequality, we have:
1a+1b+1c31abc3. \frac{1}{a} + \frac{1}{b} + \frac{1}{c} \geq 3 \sqrt[3]{\frac{1}{abc}}.
Given that 1a+1b+1c=1\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1, it follows that:
131abc3    131abc3    27abc. 1 \geq 3 \sqrt[3]{\frac{1}{abc}} \implies \frac{1}{3} \geq \sqrt[3]{\frac{1}{abc}} \implies 27 \geq abc.

2. Using Cauchy-Schwarz Inequality:
We apply the Cauchy-Schwarz inequality in the form:
(a2n+1+b2nc+bc2n)(1a+1b+1c)(an+bn+cn)2. (a^{2n+1} + b^{2n}c + bc^{2n}) \left( \frac{1}{a} + \frac{1}{b} + \frac{1}{c} \right) \geq (a^n + b^n + c^n)^2.
Given 1a+1b+1c=1\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1, we have:
a2n+1+b2nc+bc2n(an+bn+cn)2. a^{2n+1} + b^{2n}c + bc^{2n} \geq (a^n + b^n + c^n)^2.

3. **Analyzing the Expression E(a,b,c)E(a,b,c):**
We need to maximize:
E(a,b,c)=ana2n+1+b2nc+bc2n+bnb2n+1+c2na+ca2n+cnc2n+1+a2nb+ab2n. E(a,b,c) = \frac{a^n}{a^{2n+1} + b^{2n}c + bc^{2n}} + \frac{b^n}{b^{2n+1} + c^{2n}a + ca^{2n}} + \frac{c^n}{c^{2n+1} + a^{2n}b + ab^{2n}}.
Using the inequality derived from Cauchy-Schwarz:
ana2n+1+b2nc+bc2nan(an+bn+cn)2. \frac{a^n}{a^{2n+1} + b^{2n}c + bc^{2n}} \leq \frac{a^n}{(a^n + b^n + c^n)^2}.
Similarly for the other terms, we get:
E(a,b,c)an(an+bn+cn)2+bn(an+bn+cn)2+cn(an+bn+cn)2. E(a,b,c) \leq \frac{a^n}{(a^n + b^n + c^n)^2} + \frac{b^n}{(a^n + b^n + c^n)^2} + \frac{c^n}{(a^n + b^n + c^n)^2}.
Factoring out the common denominator:
E(a,b,c)an+bn+cn(an+bn+cn)2=1an+bn+cn. E(a,b,c) \leq \frac{a^n + b^n + c^n}{(a^n + b^n + c^n)^2} = \frac{1}{a^n + b^n + c^n}.

4. Maximizing the Expression:
To maximize E(a,b,c)E(a,b,c), we need to minimize an+bn+cna^n + b^n + c^n. Given a=b=c=3a = b = c = 3 (since 1a+1b+1c=1\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1 and a,b,ca, b, c are positive numbers), we have:
an+bn+cn=3n+3n+3n=33n=3n+1. a^n + b^n + c^n = 3^n + 3^n + 3^n = 3 \cdot 3^n = 3^{n+1}.
Therefore:
E(a,b,c)13n+1. E(a,b,c) \leq \frac{1}{3^{n+1}}.

5. Conclusion:
The maximum value of E(a,b,c)E(a,b,c) is achieved when a=b=c=3a = b = c = 3, giving:
E(a,b,c)=13n+1. E(a,b,c) = \frac{1}{3^{n+1}}.

The final answer is 13n+1\boxed{\frac{1}{3^{n+1}}}.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.