Difference between revisions of "2003 AMC 10B Problems/Problem 16"
m (changed headers) |
Baldisbasics (talk | contribs) m (→Solution 1) |
||
Line 13: | Line 13: | ||
6m^2 &\geq 365\ | 6m^2 &\geq 365\ | ||
m^2 &\geq 60.83\ldots.\end{align*}</cmath> | m^2 &\geq 60.83\ldots.\end{align*}</cmath> | ||
− | + | Also, year 2003 is not a leap year, because 2003 divided by 4 does not equal and integer. | |
The smallest integer value that satisfies this is <math>\boxed{\textbf{(E)}\ 8}</math>. | The smallest integer value that satisfies this is <math>\boxed{\textbf{(E)}\ 8}</math>. | ||
− | |||
===Solution 2=== | ===Solution 2=== |
Revision as of 22:56, 1 February 2020
Contents
[hide]Problem
A restaurant offers three desserts, and exactly twice as many appetizers as main courses. A dinner consists of an appetizer, a main course, and a dessert. What is the least number of main courses that a restaurant should offer so that a customer could have a different dinner each night in the year ?
Solution
Solution 1
Let be the number of main courses the restaurant serves, so is the number of appetizers. Then the number of dinner combinations is . Since the customer wants to eat a different dinner in all days of , we must have
Also, year 2003 is not a leap year, because 2003 divided by 4 does not equal and integer. The smallest integer value that satisfies this is .
Solution 2
Let denote the number of main courses needed to meet the requirement. Then the number of dinners available is . Thus must be at least . Since , main courses is enough, but 7 is not. The smallest integer value that satisfies this is .
See Also
2003 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 15 |
Followed by Problem 17 | |
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.