Difference between revisions of "2000 USAMO Problems/Problem 3"
m (→See Also) |
|||
| Line 9: | Line 9: | ||
{{USAMO newbox|year=2000|num-b=2|num-a=4}} | {{USAMO newbox|year=2000|num-b=2|num-a=4}} | ||
| − | [[Category:Olympiad | + | [[Category:Olympiad Combinatorics Problems]] |
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 08:51, 20 July 2016
Problem
A game of solitaire is played with 
red cards, 
white cards, and 
blue cards. A player plays all the cards one at a time. With each play he accumulates a penalty. If he plays a blue card, then he is charged a penalty which is the number of white cards still in his hand. If he plays a white card, then he is charged a penalty which is twice the number of red cards still in his hand. If he plays a red card, then he is charged a penalty which is three times the number of blue cards still in his hand. Find, as a function of 
and 
the minimal total penalty a player can amass and all the ways in which this minimum can be achieved.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2000 USAMO (Problems • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
