Difference between revisions of "2014 AMC 10B Problems/Problem 11"
(→Problem: Someone changed the question so I fixed it.) |
Wolfpencil (talk | contribs) (→Problem) |
||
Line 10: | Line 10: | ||
What is the smallest possible positive integer value of <math>n</math>? | What is the smallest possible positive integer value of <math>n</math>? | ||
− | <math> \textbf{(A)}\ \ 27\qquad\textbf{(B)}\ 28\qquad\textbf{(C)}\ 29\qquad\textbf{(D) | + | <math> \textbf{(A)}\ \ 27\qquad\textbf{(B)}\ 28\qquad\textbf{(C)}\ 29\qquad\textbf{(D)}\ 31\qquad\textbf{(E)}\ 33 </math> |
==Solution== | ==Solution== |
Revision as of 22:24, 10 July 2015
Problem
For the consumer, a single discount of is more advantageous than any of the following discounts:
(1) two successive discounts
(2) three successive discounts
(3) a discount followed by a discount
What is the smallest possible positive integer value of ?
Solution
Let the original price be . Then, for option , the discounted price is . For option , the discounted price is . Finally, for option , the discounted price is . Therefore, must be greater than . It follows must be greater than . We multiply this by to get the percent value, and then round up because is the smallest integer that provides a greater discount than , leaving us with the answer of
See Also
2014 AMC 10B (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.