Difference between revisions of "2003 AMC 10B Problems/Problem 4"
m |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{duplicate|[[2003 AMC 12B Problems|2003 AMC 12B #3]] and [[2003 AMC 10B Problems|2003 AMC 10B #4]]}} | ||
| + | |||
==Problem== | ==Problem== | ||
| Line 29: | Line 31: | ||
==See Also== | ==See Also== | ||
| − | + | {{AMC12 box|year=2003|ab=B|num-b=2|num-a=4}} | |
{{AMC10 box|year=2003|ab=B|num-b=3|num-a=5}} | {{AMC10 box|year=2003|ab=B|num-b=3|num-a=5}} | ||
| + | {{MAA Notice}} | ||
Latest revision as of 23:11, 4 January 2014
- The following problem is from both the 2003 AMC 12B #3 and 2003 AMC 10B #4, so both problems redirect to this page.
Problem
Rose fills each of the rectangular regions of her rectangular flower bed with a different type of flower. The lengths, in feet, of the rectangular regions in her flower bed are as shown in the figure. She plants one flower per square foot in each region. Asters cost 
each, begonias 
each, cannas 
each, dahlias 
each, and Easter lilies 
each. What is the least possible cost, in dollars, for her garden?
![[asy] unitsize(5mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((6,0)--(0,0)--(0,1)--(6,1)); draw((0,1)--(0,6)--(4,6)--(4,1)); draw((4,6)--(11,6)--(11,3)--(4,3)); draw((11,3)--(11,0)--(6,0)--(6,3)); label("1",(0,0.5),W); label("5",(0,3.5),W); label("3",(11,1.5),E); label("3",(11,4.5),E); label("4",(2,6),N); label("7",(7.5,6),N); label("6",(3,0),S); label("5",(8.5,0),S);[/asy]](http://latex.artofproblemsolving.com/5/3/6/53688e514d1c6f1f99b771578717677d9fec99b3.png)
Solution
The areas of the five regions from greatest to least are 
and 
.
If we want to minimize the cost, we want to maximize the area of the cheapest flower and minimize the area of the most expensive flower. Doing this, the cost is 
, which simplifies to 
.
Therefore the answer is 
.
See Also
| 2003 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 2 |
Followed by Problem 4 |
| 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 | |
| 2003 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 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. 
