Difference between revisions of "2001 AMC 10 Problems/Problem 11"
Pidigits125 (talk | contribs) (→Solution 1) |
Pidigits125 (talk | contribs) (→Solution 1) |
||
Line 13: | Line 13: | ||
There are <math> 2(2n+1)+2(2n-1)=4n+2+4n-2=8n </math> unit squares in the <math> n^\text{th} </math> ring. | There are <math> 2(2n+1)+2(2n-1)=4n+2+4n-2=8n </math> unit squares in the <math> n^\text{th} </math> ring. | ||
− | Thus, the <math>100^\text{th}</math> ring has <math> 8 \times 100 = \boxed{\textbf{(C)} 800} </math>. | + | Thus, the <math>100^\text{th}</math> ring has <math> 8 \times 100 = \boxed{\textbf{(C)} 800} </math> unit squares. |
+ | |||
+ | === Solution 2 (Alternate Solution) === | ||
+ | |||
+ | We can make the <math> n^\text{th} </math> ring by removing a square of side length <math> 2n-1 </math> from a square of side length <math> 2n+1 </math>. | ||
+ | |||
+ | This ring contains <math> (2n+1)^2-(2n-1)^2=(4n^2+4n+1)-(4n^2-4n+1)=8n </math> unit squares. | ||
+ | |||
+ | Thus, the <math> 100^\text{th} </math> ring has <math> 8 \times 100 = \boxed{\textbf{(C)}\ 800} </math> unit squares. |
Revision as of 15:18, 16 March 2011
Problem
Consider the dark square in an array of unit squares, part of which is shown. The first ring of squares around this center square contains unit squares. The second ring contains unit squares. If we continue this process, the number of unit squares in the ring is
Solutions
Solution 1
We can partition the ring into rectangles: two containing unit squares and two containing unit squares.
There are unit squares in the ring.
Thus, the ring has unit squares.
Solution 2 (Alternate Solution)
We can make the ring by removing a square of side length from a square of side length .
This ring contains unit squares.
Thus, the ring has unit squares.