Difference between revisions of "2020 AMC 8 Problems/Problem 4"
MRENTHUSIASM (talk | contribs) m (→Solution 5 (Brute Force)) |
MRENTHUSIASM (talk | contribs) (→Problem: Simplified code, and made hexagons aligned to bottom.) |
||
Line 3: | Line 3: | ||
<asy> | <asy> | ||
+ | // diagram by SirCalcsALot, edited by MRENTHUSIASM | ||
size(250); | size(250); | ||
− | + | path p = scale(0.7)*unitcircle; | |
− | + | pair[] A; | |
− | |||
− | |||
− | |||
− | pair | ||
pen grey1 = rgb(100/256, 100/256, 100/256); | pen grey1 = rgb(100/256, 100/256, 100/256); | ||
pen grey2 = rgb(183/256, 183/256, 183/256); | pen grey2 = rgb(183/256, 183/256, 183/256); | ||
− | + | for (int i=0; i<7; ++i) { A[i] = rotate(60*i)*(1,0);} | |
− | for (int i = 0; i < | + | path hex = A[0]--A[1]--A[2]--A[3]--A[4]--A[5]--cycle; |
− | + | fill(p,grey1); | |
− | + | draw(hex,black+linewidth(1.25)); | |
− | fill( | + | pair S = 5A[0]+2A[1]; |
− | for (int i = 0; i < 6; ++i) { | + | fill(shift(S)*p,grey1); |
− | fill( | + | for (int i=0; i<6; ++i) { fill(shift(S+2*A[i])*p,grey2);} |
− | draw( | + | draw(shift(S)*scale(3)*hex,black+linewidth(1.25)); |
− | + | pair T = 15A[0]+4A[1]; | |
− | fill( | + | fill(shift(T)*p,grey1); |
− | for (int i = 0; i < 6; ++i) { | + | for (int i=0; i<6; ++i) { |
− | fill( | + | fill(shift(T+2*A[i])*p,grey2); |
− | fill( | + | fill(shift(T+4*A[i])*p,grey1); |
− | fill( | + | fill(shift(T+2*A[i]+2*A[i+1])*p,grey1); |
− | |||
} | } | ||
+ | draw(shift(T)*scale(5)*hex,black+linewidth(1.25)); | ||
</asy> | </asy> | ||
Revision as of 15:58, 7 October 2021
Contents
Problem
Three hexagons of increasing size are shown below. Suppose the dot pattern continues so that each successive hexagon contains one more band of dots. How many dots are in the next hexagon?
Solution 1
Looking at the rows of each hexagon, we see that the first hexagon has dot, the second has dots, and the third has dots. Given the way the hexagons are constructed, it is clear that this pattern continues. Hence, the fourth hexagon has dots.
Solution 2
The first hexagon has dot, the second hexagon has dots, the third hexagon dots, and so on. The pattern continues since to go from hexagon to hexagon we add a new ring of dots around the outside of the existing ones, with each side of the ring having side length Thus the number of dots added is (we subtract as each of the corner hexagons in the ring is counted as part of two sides), confirming the pattern. We therefore predict that that the fourth hexagon has dots.
Solution 3 (Variant of Solution 2)
The dots in the next hexagon have four layers. From innermost to outermost:
- The first layer has dot.
- The second layer has dots: dot at each vertex of the hexagon.
- The third layer has dots: dot at each vertex of the hexagon and other dot on each edge of the hexagon.
- The fourth layer has dots: dot at each vertex of the hexagon and other dots on each edge of the hexagon.
Together, the answer is
~MRENTHUSIASM
Solution 4 (Variant of Solution 2)
Let the number of dots in the first hexagon be By the same argument as in Solution 2, we have for Using this, we find that and
Solution 5 (Brute Force)
From the full diagram below, the answer is ~MRENTHUSIASM
Video Solution
https://www.youtube.com/watch?v=_IjQnXnVKeU
Video Solution by WhyMath
~savannahsolver
Video Solution
Video Solution by Interstigation
https://youtu.be/YnwkBZTv5Fw?t=123
~Interstigation
See also
2020 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
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.