Difference between revisions of "2009 AIME I Problems/Problem 9"
God of Math (talk | contribs) (New page: We are given the 7 digits of the values, so let us find the ways we can distrubute these digits among the prizes. We are supposed to find the ways to group the digits such that each price ...) |
|||
| Line 1: | Line 1: | ||
| + | == Problem == | ||
| + | A game show offers a contestant three prizes A, B and C, each of which is worth a whole number of dollars from <dollar/><math>1</math> to <dollar/><math>9999</math> inclusive. The contestant wins the prizes by correctly guessing the price of each prize in the order A, B, C. As a hint, the digits of the three prices are given. On a particular day, the digits given were <math>1, 1, 1, 1, 3, 3, 3</math>. Find the total number of possible guesses for all three prizes consistent with the hint. | ||
| + | |||
| + | == Solution == | ||
We are given the 7 digits of the values, so let us find the ways we can distrubute these digits among the prizes. We are supposed to find the ways to group the digits such that each price has at least one digit, and no prices have 5 or more digits. We can express 7 this way as : | We are given the 7 digits of the values, so let us find the ways we can distrubute these digits among the prizes. We are supposed to find the ways to group the digits such that each price has at least one digit, and no prices have 5 or more digits. We can express 7 this way as : | ||
| Line 6: | Line 10: | ||
Let us begin with the first case. The possibilities are like so: | Let us begin with the first case. The possibilities are like so: | ||
| − | + | When we construct the table for the 1 and 2 digit numbers, we just permute the other 4 to find the choices for the 4 digit number | |
1 digit number 2 digit number 4 digit number | 1 digit number 2 digit number 4 digit number | ||
| Line 18: | Line 22: | ||
3 31 4 choose 3, or 4 numbers | 3 31 4 choose 3, or 4 numbers | ||
3 33 4 choose 4, or 1 number | 3 33 4 choose 4, or 1 number | ||
| − | -- | + | |
| + | == See also == | ||
| + | {{AIME box|year=2009|n=I|num-b=8|num-a=10}} | ||
Revision as of 20:15, 20 March 2009
Problem
A game show offers a contestant three prizes A, B and C, each of which is worth a whole number of dollars from <dollar/>
to <dollar/>
inclusive. The contestant wins the prizes by correctly guessing the price of each prize in the order A, B, C. As a hint, the digits of the three prices are given. On a particular day, the digits given were 
. Find the total number of possible guesses for all three prizes consistent with the hint.
Solution
We are given the 7 digits of the values, so let us find the ways we can distrubute these digits among the prizes. We are supposed to find the ways to group the digits such that each price has at least one digit, and no prices have 5 or more digits. We can express 7 this way as :
4, 2, 1 3, 3, 1 3, 2, 2
Let us begin with the first case. The possibilities are like so: When we construct the table for the 1 and 2 digit numbers, we just permute the other 4 to find the choices for the 4 digit number
1 digit number 2 digit number 4 digit number
1 11 4 choose 1, or 4 numbers 1 13 4 choose 2, or 6 numbers 1 31 4 choose 2, or 6 numbers 1 33 4 choose 3, or 4 numbers 3 11 4 choose 2, or 6 numbers 3 13 4 choose 3, or 4 numbers 3 31 4 choose 3, or 4 numbers 3 33 4 choose 4, or 1 number
See also
| 2009 AIME I (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 | ||
| All AIME Problems and Solutions | ||
