Back to Advanced source practice
AdvancedVery HardMCQ Source: LaTeX
Algebra/Symmetric polynomials / Optimisation

Question

[Algebra -- Symmetric polynomials / Optimisation, Very Hard, MCQ]

Let a,b,ca, b, c be non-negative real numbers satisfying a+b+c=6a + b + c = 6 and ab+bc+ca=9ab + bc + ca = 9. The maximum possible value of abcabc is:

Options

A

2

B

3

C

4

D

6

Answer

(C) 4.

Detailed solution

[Max of abcabc with fixed e1,e2e_1, e_2]

The numbers a,b,ca, b, c are the roots of the cubic

$

t^{3} - 6t^{2} + 9t - p = 0, \quad \text{where } p = abc.

$

Define g(t)=t(t3)2=t36t2+9tg(t) = t(t-3)^{2} = t^{3} - 6t^{2} + 9t. The cubic becomes g(t)=pg(t) = p. We need three real non-negative roots.

g(t)=3(t1)(t3)g'(t) = 3(t-1)(t-3): local max g(1)=4g(1) = 4, local min g(3)=0g(3) = 0. For 0p40 \le p \le 4, g(t)=pg(t) = p has three real roots. For 0<p<40 < p < 4, all three roots lie in (0,)(0, \infty) (one in (0,1)(0,1), one in (1,3)(1,3), one in (3,)(3, \infty)). At the boundary p=4p = 4, the roots are 1,1,41, 1, 4, which satisfy 1+1+4=61+1+4 = 6 and 1 ⁣ ⁣1+1 ⁣ ⁣4+1 ⁣ ⁣4=91\!\cdot\!1 + 1\!\cdot\!4 + 1\!\cdot\!4 = 9. For p>4p > 4, only one root is real.

Hence the maximum of abcabc is 44, attained at (a,b,c)=(1,1,4)(a, b, c) = (1, 1, 4) (and permutations). Answer: (C) 4.

Why CAT-level: The Newton-Vieta linkage between abcabc and a cubic in one variable is non-obvious; AM-GM gives only weak bounds here.