Difference between revisions of "2016 AMC 12B Problems/Problem 15"
(→Solution 3 (really fast)) |
m (→Solution 3 (really fast)) |
||
| Line 32: | Line 32: | ||
==Solution 3 (really fast)== | ==Solution 3 (really fast)== | ||
| − | First, we see that we want to try and maximize each vertex. Since the multiplication of each vertex is the product of three values, we want to maximize those three values. Doing so, we see that we want them to be as close as possible, giving <math>4.5^3</math> (the average of all the values). This gives us the maximum for each vertex, multiplied by the 8 vertices, yields our answer <math>\boxed{\textbf{(D)}\ 729 }</math> | + | First, we see that we want to try and maximize each vertex. Since the multiplication of each vertex is the product of three values, we want to maximize those three values. Doing so, we see that we want them to be as close as possible, giving <math>4.5^3</math> (the average of all the values). This gives us the maximum for each vertex, multiplied by the 8 vertices, yields our answer <math>\boxed{\textbf{(D)}\ 729 }</math> Also note that if you cannot evaluate <math>4.5^3</math> quickly, a rough approximation of <math>5*4.5*4*8</math> will yield 720, very close to our answer. -rayprati |
==See Also== | ==See Also== | ||
{{AMC12 box|year=2016|ab=B|num-b=14|num-a=16}} | {{AMC12 box|year=2016|ab=B|num-b=14|num-a=16}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 18:28, 14 April 2020
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,
![\[\frac{a_1+a_2+a_3}{3}\geq\sqrt[3]{a_1a_2a_3}\]](http://latex.artofproblemsolving.com/a/a/6/aa67eef8049086302c27d7648d8e0d17e704e7dd.png)
Cubing both sides,
![\[\left(\frac{a_1+a_2+a_3}{3}\right)^3\geq{a_1a_2a_3}\]](http://latex.artofproblemsolving.com/2/3/3/233c106eb78fd6060382033db69c868915a0e2ac.png)
Let 
, 
, and 
. Let's substitute in these values.
![\[\left(\frac{a+b+c+d+e+f}{3}\right)^3\geq{(a+f)(b+c)(d+e)}\]](http://latex.artofproblemsolving.com/0/6/d/06d6e468f555fb1ee6e69b3607de98a90f68cee5.png)
is fixed at 27.
![\[\left(\frac{27}{3}\right)^3\geq{(a+f)(b+c)(d+e)}\]](http://latex.artofproblemsolving.com/4/2/e/42e6a5120a4a3947aa06a9123846cb6a117c1564.png)
![\[\boxed{\textbf{(D)}\ 729 }\geq{(a+f)(b+c)(d+e)}\]](http://latex.artofproblemsolving.com/2/8/3/283da114e616eca58fa458e4073c4b6772997789.png)
Solution 3 (really fast)
First, we see that we want to try and maximize each vertex. Since the multiplication of each vertex is the product of three values, we want to maximize those three values. Doing so, we see that we want them to be as close as possible, giving 
(the average of all the values). This gives us the maximum for each vertex, multiplied by the 8 vertices, yields our answer Also note that if you cannot evaluate quickly, a rough approximation of 
will yield 720, very close to our answer. -rayprati
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. 
