Difference between revisions of "2017 AMC 10B Problems/Problem 6"
(→Solution) |
Ishankhare (talk | contribs) (→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | What is the largest number of solid <math>2</math> | + | What is the largest number of solid <math>2\text{in}</math> by <math>2\text{in}</math> by <math>1\text{in}</math> blocks that can fit in a <math>3\text{in}</math> by <math>2\text{in}</math> by <math>3\text{in}</math> box? |
| − | <math>\textbf{(A)}\ | + | <math>\textbf{(A)}\ 3\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7</math> |
==Solution== | ==Solution== | ||
Revision as of 10:27, 16 February 2017
Problem
What is the largest number of solid 
by by 
blocks that can fit in a 
by by box?
Solution
By simply finding the volume of the larger block, we see that its area is 
. The volume of the smaller block is 
. Dividing the two, we see that only a maximum of 
in xin x
in blocks can fit inside a 
-in by in by in box. ![$\qquad\textbf{(B)}\ [4]$](http://latex.artofproblemsolving.com/3/d/b/3dba911831a298e206e7391fc50412fcc4bb2610.png)
| 2017 AMC 10b (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 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. 
