Difference between revisions of "2002 AIME II Problems/Problem 4"
(→Solution) |
|||
Line 9: | Line 9: | ||
When <math>n>1</math>, the path of blocks has <math>6(n-1)</math> blocks total in it. When <math>n=1</math>, there is just one lonely block. Thus, the area of the garden enclosed by the path when <math>n=202</math> is | When <math>n>1</math>, the path of blocks has <math>6(n-1)</math> blocks total in it. When <math>n=1</math>, there is just one lonely block. Thus, the area of the garden enclosed by the path when <math>n=202</math> is | ||
− | <cmath>(1+6+12+18+\cdots +1200)A</cmath>, | + | <cmath>(1+6+12+18+\cdots +1200)A=(1+6(1+2+3...+200))A=(1+6((200)(201)/2))A=120601A</cmath>, |
where <math>A</math> is the area of one block. Since <math>A=\dfrac{3\sqrt{3}}{2}</math>, the area of the garden is | where <math>A</math> is the area of one block. Since <math>A=\dfrac{3\sqrt{3}}{2}</math>, the area of the garden is |
Revision as of 16:45, 8 December 2015
Problem
Patio blocks that are hexagons unit on a side are used to outline a garden by placing the blocks edge to edge with on each side. The diagram indicates the path of blocks around the garden when .
If , then the area of the garden enclosed by the path, not including the path itself, is square units, where is a positive integer. Find the remainder when is divided by .
Solution
When , the path of blocks has blocks total in it. When , there is just one lonely block. Thus, the area of the garden enclosed by the path when is
,
where is the area of one block. Since , the area of the garden is
.
, Remainder .
See also
2002 AIME II (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 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.