Difference between revisions of "2000 AMC 12 Problems/Problem 8"
Dairyqueenxd (talk | contribs) (→Solution 6 (Newton's Forward Differences)) |
m (→Solution 4) |
||
Line 82: | Line 82: | ||
Let <math>a_n</math> be the number of squares in figure <math>n</math>. We can easily see that | Let <math>a_n</math> be the number of squares in figure <math>n</math>. We can easily see that | ||
<cmath>a_0=4\cdot 0+1</cmath> | <cmath>a_0=4\cdot 0+1</cmath> | ||
− | <cmath>a_1=4\cdot | + | <cmath>a_1=4\cdot 2+1</cmath> |
<cmath>a_2=4\cdot 3+1</cmath> | <cmath>a_2=4\cdot 3+1</cmath> | ||
<cmath>a_3=4\cdot 6+1.</cmath> | <cmath>a_3=4\cdot 6+1.</cmath> | ||
+ | See that we multiply the number we are on to the next consecutive number. | ||
Note that in <math>a_n</math>, the number multiplied by the 4 is the <math>n</math>th triangular number. Hence, <math>a_{100}=4\cdot \frac{100\cdot 101}{2}+1=\boxed{\textbf{(C) }20201}</math>. | Note that in <math>a_n</math>, the number multiplied by the 4 is the <math>n</math>th triangular number. Hence, <math>a_{100}=4\cdot \frac{100\cdot 101}{2}+1=\boxed{\textbf{(C) }20201}</math>. | ||
− | |||
==Solution 5== | ==Solution 5== |
Revision as of 21:16, 5 January 2022
- The following problem is from both the 2000 AMC 12 #8 and 2000 AMC 10 #12, so both problems redirect to this page.
Contents
Problem
Figures , , , and consist of , , , and nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?
Video:
https://www.youtube.com/watch?v=HVP6qjKAkjA&t=2s
Solution 1
We can divide up figure to get the sum of the sum of the first odd numbers and the sum of the first odd numbers. If you do not see this, here is the example for :
The sum of the first odd numbers is , so for figure , there are unit squares. We plug in to get .
Solution 2
Using the recursion from solution 1, we see that the first differences of form an arithmetic progression, and consequently that the second differences are constant and all equal to . Thus, the original sequence can be generated from a quadratic function.
If , and , , and , we get a system of three equations in three variables:
gives
gives
gives
Plugging in into the last two equations gives
Dividing the second equation by 2 gives the system:
Subtracting the first equation from the second gives , and hence . Thus, our quadratic function is:
Calculating the answer to our problem, , which is choice .
Solution 3
We can see that each figure has a central box and 4 columns of boxes on each side of each square. Therefore, at figure 100, there is a central box with 100 boxes on the top, right, left, and bottom. Knowing that each quarter of each figure has a pyramid structure, we know that for each quarter there are squares. . Adding in the original center box we have .
Solution 4
Let be the number of squares in figure . We can easily see that See that we multiply the number we are on to the next consecutive number. Note that in , the number multiplied by the 4 is the th triangular number. Hence, .
Solution 5
Let denote the number of unit cubes in a figure. We have
Computing the difference between the number of cubes in each figure yields It is easy to notice that this is an arithmetic sequence, with the first term being and the difference being . Let this sequence be
From to , the sequence will have terms. Using the arithmetic sum formula yields
So unit cubes.
~ljlbox
Solution 6 (Newton's Forward Differences)
We know that 1 and 5 differ by 4, 5 and 13 differ by 8, and 13 and 25 differ by 12. Hence the differences are 4, 8, and 12, resp. And the differences of the differences area all 4. So by Newton's Forward Difference Formula, we get the 100th figure is(because Figure 0 exists) or -vsamc
See Also
2000 AMC 12 (Problems • Answer Key • Resources) | |
Preceded by Problem 7 |
Followed by Problem 9 |
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 12 Problems and Solutions |
2000 AMC 10 (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
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.