Difference between revisions of "2002 AMC 12A Problems/Problem 9"
m (→Solution) |
(→Solution) |
||
Line 14: | Line 14: | ||
Thus our answer is <math>3+10 = \boxed{ \text{(B)}\ 13 }</math>. | Thus our answer is <math>3+10 = \boxed{ \text{(B)}\ 13 }</math>. | ||
+ | |||
+ | NOTE: YOU CAN DO THIS THE WEIRD WAY | ||
==See Also== | ==See Also== |
Revision as of 09:41, 5 September 2016
- The following problem is from both the 2002 AMC 12A #9 and 2002 AMC 10A #11, so both problems redirect to this page.
Problem
Jamal wants to save 30 files onto disks, each with 1.44 MB space. 3 of the files take up 0.8 MB, 12 of the files take up 0.7 MB, and the rest take up 0.4 MB. It is not possible to split a file onto 2 different disks. What is the smallest number of disks needed to store all 30 files?
Solution
A 0.8 MB file can either be on its own disk, or share it with a 0.4 MB. Clearly it is better to pick the second possibility. Thus we will have 3 disks, each with one 0.8 MB file and one 0.4 MB file.
We are left with 12 files of 0.7 MB each, and 12 files of 0.4 MB each. Their total size is MB. The total capacity of 9 disks is MB, hence we need at least 10 more disks. And we can easily verify that 10 disks are indeed enough: six of them will carry two 0.7 MB files each, and four will carry three 0.4 MB files each.
Thus our answer is .
NOTE: YOU CAN DO THIS THE WEIRD WAY
See Also
2002 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 8 |
Followed by Problem 10 |
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 |
2002 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
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.