This problem is a showcase of the homogenisation technique: substituting a constraint (a+b+c=1) directly into an expression to unlock symmetric structure. The three-part scaffold guides you from a simple algebraic manipulation to a full product inequality, while a slick alternative solution shows how expanding the LHS and invoking standard sub-inequalities can reach the bound in one clean sweep.
Problem Statement
Let a,b, and c be positive real numbers such that a+b+c=1.
i. By writing a1+1 as a single fraction, show that a1+1=a2a+b+c.
ii. By applying the AM-GM inequality to the terms a,a,b, and c, show that:
a1+1≥a44a2bc
iii. Hence, prove that:
(a1+1)(b1+1)(c1+1)≥64
Hints
Part (i): Start by finding a common denominator for a1+1, giving a1+a. Then use the given condition a+b+c=1 to replace the 1 in the numerator.
Part (ii): The numerator from Part (i) is 2a+b+c. Split the 2a into a+a so you have exactly four positive terms, then apply AM-GM for n=4.
Part (iii): Because the inequality is symmetric in a,b,c, establish analogous inequalities for the factors containing b and c. Multiply the three inequalities together and simplify the resulting powers.
Solutions
Part (i)
a1+1=a1+a
Since a+b+c=1, substitute into the numerator:
a1+a=a(a+b+c)+a=a2a+b+c□
Part (ii)
Consider the four positive numbers a,a,b,c. By the AM-GM inequality for four terms:
4a+a+b+c≥4a⋅a⋅b⋅c2a+b+c≥44a2bc
Dividing both sides by the strictly positive quantity a:
a2a+b+c≥a44a2bc
Substituting the result from Part (i) yields:
a1+1≥a44a2bc□
Part (iii) — Method 1: AM-GM on Individual Factors
By symmetry, applying the identical argument to the other two factors gives:
b1+1≥b44ab2c,c1+1≥c44abc2
Since all factors are positive, multiply the three inequalities:
Part (iii) — Method 2: Direct Expansion (Alternative)
Expand the left-hand side:
LHS=1+(a1+b1+c1)+(ab1+bc1+ca1)+abc1
Notice that ab1+bc1+ca1=abcc+a+b=abc1 (using a+b+c=1). So:
LHS=1+(a1+b1+c1)+abc2
Now bound each piece using two standard AM-GM results:
Sum of reciprocals: By AM-HM (or AM-GM applied to a1,b1,c1):
a1+b1+c1≥a+b+c9=9
Product bound: AM-GM on a+b+c=1 gives 31≥3abc, so abc≤271, hence abc1≥27.
Substituting these lower bounds:
LHS≥1+9+2(27)=1+9+54=64□
Takeaways
Homogenisation: Substituting a constraint like a+b+c=1 directly into an expression is a powerful technique. It converts constants into symmetric variable expressions that are immediately amenable to AM-GM.
Splitting Terms: Part (ii) requires recognising that 2a must be written as a+a to generate a four-term AM-GM. This is deliberate: the symmetry of the split ensures the fourth roots cancel cleanly when the three inequalities are multiplied.
The Power of Expansion: The alternative solution highlights the value of recognising standard sub-inequalities (∑x1≥∑xn2). Expanding a product in an inequality problem often reveals independent components that can each be bounded individually, sidestepping the scaffold entirely.