Problem:
Let x,y and z be three positive real numbers whose sum is 1. If no one of these numbers is more than twice any other, then the minimum possible value of the product xyz is
Answer Choices:
A. 321β
B. 361β
C. 1254β
D. 1271β
E. none of these
Solution:
Let m=x0βy0βz0β be the minimum value. By symmetry, we may assume x0ββ©½ y0ββ©½z0β. In fact z0β=2x0β, for if z0β<2x0β, then by decreasing x0β slightly, increasing z0β by the same amount, and keeping y0β fixed, we would get new values which still meet the constraints but which have a smaller product contradiction! To show this contradiction formally, let x1β=x0ββh and z1β =z0β+h, where h>0 is so small that z1ββ©½2x1β also. Then x1β,y0β,z1β also meet all the original constraints, and
x1βy0βz1ββ=(x0ββh)y0β(z0β+h)=x0βy0βz0β+y0β[h(x0ββz0β)βh2]<x0βy0βz0ββ
So z0β=2x0β,y0β=1βx0ββz0β=1β3x0β, and m=2x02β(Iβ3x0β). Also, x0ββ©½1β3x0ββ©½2x0β, or equivalently, 51ββ©½x0ββ©½41β. Thus m may be viewed as a value of the function f(x)=2x2(1β3x) on the domain D= {xβ£β£β£β£β£β51ββ©½xβ©½41β}. In fact, m is the smallest value of f on D, because minimizing f on D is just a restricted version of the original problem: for each xβD, setting y=1β3x and z=2x gives x,y,z meeting the original constraints, and makes f(x)=xyz.
To minimize f on D, first sketch f for all real x. (See Figure.) Since f has a relative minimum at x=0(f(x) has the same sign as x2 for x<31β), and cubics have at most one relative minimum, the minimum of f on D must be at one of the endpoints. In fact,
f(41β)=321ββ©½f(51β)=1254β.
(If f had another relative minimum between its two zeros, say at point x=a, then the equation f(x)=f(a) would have at least 4 roots draw a sketch. But a cubic equation has at most three roots!)