2011 AIME II Problem 9

Below is the professionally curated solution for Problem 9 of the 2011 AIME II, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2011 AIME II solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:AM-GM Inequalityfactoringbounding to limit cases

Difficulty rating: 3060

9.

Let x1,x_1, x2,x_2, ,\ldots, x6x_6 be nonnegative real numbers such that x1+x2+x3+x4+x5+x6=1,x_1 + x_2 + x_3 + x_4 + x_5 + x_6 = 1, and x1x3x5+x2x4x61540.x_1x_3x_5 + x_2x_4x_6 \ge \frac{1}{540}. Let pp and qq be positive relatively prime integers such that pq\frac{p}{q} is the maximum possible value of x1x2x3+x2x3x4+x3x4x5+x4x5x6+x5x6x1+x6x1x2.x_1x_2x_3 + x_2x_3x_4 + x_3x_4x_5 + x_4x_5x_6 + x_5x_6x_1 + x_6x_1x_2. Find p+q.p + q.

Solution:

Let r=x1x3x5+x2x4x6r = x_1x_3x_5 + x_2x_4x_6 and let ss be the cyclic sum in question. Expanding (x1+x4)(x2+x5)(x3+x6)(x_1 + x_4)(x_2 + x_5)(x_3 + x_6) produces eight triple products, which are exactly the six terms of ss together with the two terms of r.r. So r+s=(x1+x4)(x2+x5)(x3+x6),r + s = (x_1 + x_4)(x_2 + x_5)(x_3 + x_6), and by AM-GM this is at most (13)3=127.\left(\frac{1}{3}\right)^3 = \frac{1}{27}.

Therefore s127r1271540=201540=19540.s \le \frac{1}{27} - r \le \frac{1}{27} - \frac{1}{540} = \frac{20 - 1}{540} = \frac{19}{540}. Equality needs x1+x4=x2+x5=x3+x6=13x_1 + x_4 = x_2 + x_5 = x_3 + x_6 = \frac{1}{3} with r=1540:r = \frac{1}{540}: take x1=x3=310,x_1 = x_3 = \frac{3}{10}, x5=160,x_5 = \frac{1}{60}, x2=1960,x_2 = \frac{19}{60}, x4=x6=130.x_4 = x_6 = \frac{1}{30}. Then r=96000+1954000=10054000=1540,r = \frac{9}{6000} + \frac{19}{54000} = \frac{100}{54000} = \frac{1}{540}, as required.

So the maximum is 19540,\frac{19}{540}, and p+q=19+540=559.p + q = 19 + 540 = 559.

← Problem 8Full ExamProblem 10

Problem 9 in Other Years