Difference between revisions of "2016 AMC 12B Problems/Problem 15"
Taekyukim02 (talk | contribs) m (→Solution 2) |
|||
Line 15: | Line 15: | ||
We proceed from the factorization in the above solution. By the AM-GM inequality, | We proceed from the factorization in the above solution. By the AM-GM inequality, | ||
− | <cmath>\frac{a_1+a_2 | + | <cmath>\frac{a_1+a_2+a_3}{3}\geq\sqrt[3]{a_1a_2a_3}</cmath> |
Cubing both sides, | Cubing both sides, |
Revision as of 15:07, 20 December 2017
Contents
Problem
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?
Solution 1
First assign each face the letters . The sum of the product of the faces is . We can factor this into which is the product of the sum of each pair of opposite faces. In order to maximize we use the numbers or .
Solution 2
We proceed from the factorization in the above solution. By the AM-GM inequality,
Cubing both sides,
Let , , and . Let's substitute in these values.
is fixed at 27.
See Also
2016 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 14 |
Followed by Problem 16 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.