2016 AMC 10B Problem 17
All the numbers are assigned to the six faces of a cube, one number to each face. For each of the eight vertices of the cube, a product of three numbers is computed, where the three numbers are the numbers assigned to the three faces that include that vertex. What is the greatest possible value of the sum of these eight products?
Show solution without answering
Key insight
Each corner uses one face from each opposite pair, so the eight products add to (a+b)(c+d)(e+f). The pair sums total 27, so the best is 9 x 9 x 9.
Solution
Step 1: see how the corners are built.
- A cube's six faces come in three pairs of opposite faces: top and bottom, front and back, left and right. Call their numbers , and .
- Every corner touches exactly one face from each pair. For example, the top-front-left corner touches top, front and left. There are ways to pick one face from each pair, and each way is one of the corners.
Step 2: the sum is a product.
3. Multiply out . You get terms, one for every way of picking one letter from each bracket: . Those are exactly the corner products. So
Step 3: make the product as big as possible.
- The three pair sums always add to , no matter how the numbers are placed.
- Three positive numbers with a fixed total have the largest product when they are equal. For example, is less than . So the best we can hope for is three sums of each.
- We can get that: put opposite , opposite , and opposite .
The greatest sum is .
The answer is .
Why this works
When you add up the results of every possible "one from each group" choice, the total factors into a product of group sums. That turns a picture problem into a number problem: split into three parts with the largest product. Equal parts always win.
Alternative approach
Use the answer choices. The best product of three numbers adding to is , so is impossible. The pairing –, –, – reaches , and is bigger than , and , so it is the answer.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Group the six faces into three pairs of opposite faces, carrying numbers , , . A vertex touches exactly one face from each pair, and the eight vertices realize all eight choices of one face per pair. Therefore the eight vertex products are precisely the eight terms in the expansion of
and their sum equals this product.
The three pair sums add to , whatever the arrangement. A product of three positive numbers with fixed sum is largest when the numbers are equal, each (AM-GM). That is achievable: pair with , with , and with on opposite faces.
The maximum is .
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 11: Special Factorizations (§11.2, §11.3, §11.5)
- Introduction to Algebra, Chapter 20: Special Functions (§20.2, §20.5)
- Introduction to Geometry, Chapter 14: Three-Dimensional Geometry
- Introduction to Algebra, Chapter 22: Special Manipulations (§22.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.