Difference between revisions of "2020 AMC 8 Problems/Problem 16"
Sugar rush (talk | contribs) |
Harvychang (talk | contribs) (→Solution) |
||
| Line 45: | Line 45: | ||
<math>\textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }3 \qquad \textbf{(D) }4 \qquad \textbf{(E) }5</math> | <math>\textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }3 \qquad \textbf{(D) }4 \qquad \textbf{(E) }5</math> | ||
| − | ==Solution== | + | ==Solution 1== |
We can form the following expressions for the sum along each line: | We can form the following expressions for the sum along each line: | ||
<cmath>\begin{dcases}A+B+C\\A+E+F\\C+D+E\\B+D\\B+F\end{dcases}</cmath> | <cmath>\begin{dcases}A+B+C\\A+E+F\\C+D+E\\B+D\\B+F\end{dcases}</cmath> | ||
| Line 51: | Line 51: | ||
~RJ5303707 | ~RJ5303707 | ||
| + | |||
| + | ==Solution 2 (similar to Solution 1)== | ||
| + | We can see that <math>A+B+C+C+D+E+E+F+A+B+D+B+F=47</math>. Combining like terms, we get <math>2A+3B+2C+2D+2E+2F=47</math>. Since <math>A, B, C, D, E,</math> and <math>F</math> are all distinct integers ranging from 1 to 6, they must sum up to <math>21</math>, so <math>B=47-2(21)=\boxed{\textbf{(E) }5}</math>. | ||
==Video Solution== | ==Video Solution== | ||
Revision as of 22:43, 25 November 2020
Each of the points 
and 
in the figure below represents a different digit from 
to 
Each of the five lines shown passes through some of these points. The digits along each line are added to produce five sums, one for each line. The total of the five sums is 
What is the digit represented by 
![[asy] size(200); dotfactor = 10; pair p1 = (-28,0); pair p2 = (-111,213); draw(p1--p2,linewidth(1)); pair p3 = (-160,0); pair p4 = (-244,213); draw(p3--p4,linewidth(1)); pair p5 = (-316,0); pair p6 = (-67,213); draw(p5--p6,linewidth(1)); pair p7 = (0, 68); pair p8 = (-350,10); draw(p7--p8,linewidth(1)); pair p9 = (0, 150); pair p10 = (-350, 62); draw(p9--p10,linewidth(1)); pair A = intersectionpoint(p1--p2, p5--p6); dot("$A$", A, 2*W); pair B = intersectionpoint(p5--p6, p3--p4); dot("$B$", B, 2*WNW); pair C = intersectionpoint(p7--p8, p5--p6); dot("$C$", C, 1.5*NW); pair D = intersectionpoint(p3--p4, p7--p8); dot("$D$", D, 2*NNE); pair EE = intersectionpoint(p1--p2, p7--p8); dot("$E$", EE, 2*NNE); pair F = intersectionpoint(p1--p2, p9--p10); dot("$F$", F, 2*NNE); [/asy]](http://latex.artofproblemsolving.com/d/8/7/d878779f0718f46b33d37199ff7b7df96df2948e.png)
Solution 1
We can form the following expressions for the sum along each line:
![\[\begin{dcases}A+B+C\\A+E+F\\C+D+E\\B+D\\B+F\end{dcases}\]](http://latex.artofproblemsolving.com/c/e/d/ced75e75ee703776845d4ca9666de8729ada010b.png)
Adding these together, we must have 
, i.e. 
. Since 
are unique integers between and 
, we obtain 
(where the order doesn't matter as addition is commutative), so our equation simplifies to 
. This means 
.
~RJ5303707
Solution 2 (similar to Solution 1)
We can see that 
. Combining like terms, we get . Since 
and are all distinct integers ranging from 1 to 6, they must sum up to 
, so 
.
Video Solution
See also
| 2020 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 15 |
Followed by Problem 17 | |
| 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 AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
