Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2016 AMC 10B Problems/Problem 17"

(→‎Solution)
(→‎Solution 2(cheap parity): uh not answer c isnt even)
 
(10 intermediate revisions by 6 users not shown)
Line 10: Line 10:
  
 
==Solution 1==
 
==Solution 1==
−
Let us call the six sides of our cube <math>a,b,c,d,e,</math> and <math>f</math> (where <math>a</math> is opposite <math>d</math>, <math>c</math> is opposite <math>e</math>, and <math>b</math> is opposite <math>f</math>.
+
Let us call the six faces of our cube <math>a,b,c,d,e,</math> and <math>f</math> (where <math>a</math> is opposite <math>d</math>, <math>c</math> is opposite <math>e</math>, and <math>b</math> is opposite <math>f</math>.
 
Thus, for the eight vertices, we have the following products: <math>abc,abe,bcd,bde,acf,cdf,aef,</math> and <math>def</math>.
 
Thus, for the eight vertices, we have the following products: <math>abc,abe,bcd,bde,acf,cdf,aef,</math> and <math>def</math>.
 
Let us find the sum of these products:
 
Let us find the sum of these products:
Line 33: Line 33:
 
= & 729.
 
= & 729.
 
\end{align*}</cmath>
 
\end{align*}</cmath>
−
Thus our answer is <math>\textbf{\boxed{(D)729}}</math>.
+
Thus our answer is <math>\boxed{\textbf{(D) }729}</math>.
 +
 
 
==Solution 2(cheap parity)==
 
==Solution 2(cheap parity)==
−
We will use parity. If we attempt to maximize this cube in any given way, for example making sure that the sides with 5,6 and 7 all meet at one single corner, the first two answers clearly are out of bounds. Now notice the fact that any three given sides will always meet at one of the eight points. Also note the fact that there are 3 odd numbers. This means that there must be one side that has an odd area! Any odd number added with even numbers is always odd. Given that both c) and e) are both even, d) is our only choice.
+
We will use parity. If we attempt to maximize this cube in any given way, for example making sure that the sides with 5,6 and 7 all meet at one single corner, the first two answers clearly are out of bounds. Now notice the fact that any three given sides will always meet at one of the eight points. Also note the fact that there are 3 odd numbers. This means that there must be one side that has an odd area! Any odd number added with even numbers is always odd. Given that e) is even, d) is our only choice.
−
Thus our answer is <math>\textbf{\boxed{(D)729}}</math>.
+
Thus our answer is <math>\boxed{\textbf{(D) }729}</math>.
  
 
==Solution 3==
 
==Solution 3==
Line 43: Line 44:
 
==Solution 4 (Cheap Solution)==
 
==Solution 4 (Cheap Solution)==
  
 +
First, we intuitivly notice that multiplying large numbers together and smaller numbers together tends to produce larger sums, while multiplying large numbers with smaller numbers tends to produce smaller sums. From this, we guess that it is optimal to have <math>7, 6,</math> and <math>5</math> to be around one vertex to produce at least one large product of <math>210</math>. We can immediately eliminate a) and b) as answer choices since they are very close to this product, as well as e) since it is exactly <math>8 \cdot 210 </math> and we know that every following product will be smaller than this. We also guess that that is is most likely optimal to create a pairing where a number and its complement (the number that's the difference of 9 and this number) are on opposite sides. Using these two guesses, we can construct a net of sides and brute force the solution (or estimate) leaving us with <math>\boxed{\textbf{(D) }729}</math>.
  
−
Create a pairing that seems to intuitively be the optimal value, or, in other words, put a number and it's complement (the number that's the difference of 9 and this number) on opposite sides. <math>1680</math> is way too high using reasonability after you do this so you put <math>\boxed{\textbf{D }729}</math>.
+
== Video Solution by OmegaLearn==
−
 
 
−
== Video Solution ==
 
 
https://youtu.be/mgEZOXgIZXs?t=117
 
https://youtu.be/mgEZOXgIZXs?t=117
  

Latest revision as of 21:15, 29 August 2024

Problem

All the numbers $2, 3, 4, 5, 6, 7$ 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?

$\textbf{(A)}\ 312 \qquad \textbf{(B)}\ 343 \qquad \textbf{(C)}\ 625 \qquad \textbf{(D)}\ 729 \qquad \textbf{(E)}\ 1680$

Solution 1

Let us call the six faces of our cube $a,b,c,d,e,$ and $f$ (where $a$ is opposite $d$, $c$ is opposite $e$, and $b$ is opposite $f$. Thus, for the eight vertices, we have the following products: $abc,abe,bcd,bde,acf,cdf,aef,$ and $def$. Let us find the sum of these products: \[abc+abe+bcd+bde+acf+cdf+aef+def\] We notice $b$ is a factor of the first four terms, and $f$ is a factor of the last four terms. \[b(ac+ae+cd+de)+f(ac+ae+cd+de)\] Now, we can factor even more:

\begin{align*} & (b+f)(ac+ae+cd+de) \\ = &(b+f)(a(c+e)+d(c+e)) \\ = &(b+f)(a+d)(c+e) \end{align*} We have the product. Notice how the factors are sums of opposite faces. The greatest sum possible is $(7+2)$,$(6+3)$, and $(5+4)$ all factors. \begin{align*} & (7+2)(6+3)(5+4) \\ = & 9 \cdot 9 \cdot 9 \\ = & 729. \end{align*} Thus our answer is $\boxed{\textbf{(D) }729}$.

Solution 2(cheap parity)

We will use parity. If we attempt to maximize this cube in any given way, for example making sure that the sides with 5,6 and 7 all meet at one single corner, the first two answers clearly are out of bounds. Now notice the fact that any three given sides will always meet at one of the eight points. Also note the fact that there are 3 odd numbers. This means that there must be one side that has an odd area! Any odd number added with even numbers is always odd. Given that e) is even, d) is our only choice. Thus our answer is $\boxed{\textbf{(D) }729}$.

Solution 3

We first find the factorization $(b+f)(a+d)(c+e)$ using the method in Solution 1. By using AM-GM, we get, $(b+f)(a+d)(c+e) \le \left( \frac{a+b+c+d+e+f}{3} \right)^3$. To maximize the factorization, we get the answer is $\left( \frac{27}{3} \right)^3 = \boxed{\textbf{(D)}\ 729}$

Solution 4 (Cheap Solution)

First, we intuitivly notice that multiplying large numbers together and smaller numbers together tends to produce larger sums, while multiplying large numbers with smaller numbers tends to produce smaller sums. From this, we guess that it is optimal to have $7, 6,$ and $5$ to be around one vertex to produce at least one large product of $210$. We can immediately eliminate a) and b) as answer choices since they are very close to this product, as well as e) since it is exactly $8 \cdot 210$ and we know that every following product will be smaller than this. We also guess that that is is most likely optimal to create a pairing where a number and its complement (the number that's the difference of 9 and this number) are on opposite sides. Using these two guesses, we can construct a net of sides and brute force the solution (or estimate) leaving us with $\boxed{\textbf{(D) }729}$.

Video Solution by OmegaLearn

https://youtu.be/mgEZOXgIZXs?t=117

~ pi_is_3.14

See Also

2016 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 16 		Followed by
Problem 18
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 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2016_AMC_10B_Problems/Problem_17&oldid=226009"