Difference between revisions of "2009 AIME I Problems/Problem 9"
m (→Solution) |
m (→Solution) |
||
| Line 11: | Line 11: | ||
<cmath>1131331.</cmath> | <cmath>1131331.</cmath> | ||
| − | Since the strings have seven digits and three threes, there are | + | Since the strings have seven digits and three threes, there are <math>_7C_3</math> arrangements of all such strings. |
| − | |||
| − | <math>_7C_3</math> arrangements of such strings. | ||
In order to obtain all combination of A,B,C, we partition all the possible strings into 3 groups. | In order to obtain all combination of A,B,C, we partition all the possible strings into 3 groups. | ||
Revision as of 20:40, 12 March 2012
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
Since we have three numbers, consider the number of ways we can put these three numbers together in a string of 7 digits.
For example, if 
,
then the string is
![\[1131331.\]](http://latex.artofproblemsolving.com/e/8/a/e8a6fbd35349a2cea1203e4a7320d88a7e80378b.png)
Since the strings have seven digits and three threes, there are 
arrangements of all such strings.
In order to obtain all combination of A,B,C, we partition all the possible strings into 3 groups.
Let's look at the example. We have to partition it into 3 groups with each group having at least 1 digit. In other words, we need to find the solution to
![\[x+y+z=7, x,y,z>0.\]](http://latex.artofproblemsolving.com/9/5/e/95e226e82aac8471ee273f7599f82d43e97c6bc6.png)
This gives us
![\[_6C_2\]](http://latex.artofproblemsolving.com/b/b/e/bbeca8d4ef73c6e06c5233e56e80a8d7e2638268.png)
ways by balls and urns. But we have counted the one with 5 digit numbers; that is, 
.
Thus, each arrangement has ![\[(_6C_2)-3=12\]](http://latex.artofproblemsolving.com/c/c/8/cc8544ebab89906928daf06d1f95088e0a944749.png)
ways per arrangement, and there are 
ways.
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 | ||
