Difference between revisions of "2004 AMC 12B Problems/Problem 8"
m (→Problem) |
m (→Solution) |
||
| Line 8: | Line 8: | ||
== Solution == | == Solution == | ||
| − | The sum of the first <math>n</math> odd numbers is <math>n^2</math>. As in our case <math>n^2=100</math>, we have <math>n=\boxed{ | + | The sum of the first <math>n</math> odd numbers is <math>n^2</math>. As in our case <math>n^2=100</math>, we have <math>n=\boxed{\mathrm{(D)\ }10}</math>. |
== See Also == | == See Also == | ||
Revision as of 23:31, 23 July 2014
- The following problem is from both the 2004 AMC 12B #8 and 2004 AMC 10B #10, so both problems redirect to this page.
Problem
A grocer makes a display of cans in which the top row has one can and each lower row has two more cans than the row above it. If the display contains 
cans, how many rows does it contain?
Solution
The sum of the first 
odd numbers is 
. As in our case 
, we have 
.
See Also
| 2004 AMC 12B (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 | |
| 2004 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Problem 11 | |
| 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. 
