Difference between revisions of "2009 AMC 10A Problems/Problem 22"
(→Problem) |
m (→Solution 1) |
||
Line 19: | Line 19: | ||
At the moment when the numbers are in the bag, imagine that each of them has a different color. Clearly the situation is symmetric at this moment. Hence after we draw them, attach them and throw the dice, the probability of getting some pair of colors is the same for any two colors. | At the moment when the numbers are in the bag, imagine that each of them has a different color. Clearly the situation is symmetric at this moment. Hence after we draw them, attach them and throw the dice, the probability of getting some pair of colors is the same for any two colors. | ||
− | There are <math>{12 \choose 2} = 66</math> ways how to pick two of the colors. We now have to count the ways where the two chosen numbers will have sum <math>7</math>. | + | There are <math>{12 \choose 2} = 66</math> ways how to pick two of the colors. We now have to count the ways where the two chosen numbers will have a sum of <math>7</math>. |
− | + | A sum of <math>7</math> can be obtained as <math>1+6</math>, <math>2+5</math>, or <math>3+4</math>. Each number in the bag has two different colors, hence each of these three options corresponds to four pairs of colors. | |
Out of the <math>66</math> pairs of colors we can get when throwing the dice, <math>3\cdot 4=12</math> will give us the sum <math>7</math>. Hence the probability that this will happen is <math>\frac{12}{66} = \boxed{\frac 2{11}}</math>. | Out of the <math>66</math> pairs of colors we can get when throwing the dice, <math>3\cdot 4=12</math> will give us the sum <math>7</math>. Hence the probability that this will happen is <math>\frac{12}{66} = \boxed{\frac 2{11}}</math>. |
Revision as of 13:52, 29 May 2020
Problem
Two cubical dice each have removable numbers through . The twelve numbers on the two dice are removed, put into a bag, then drawn one at a time and randomly reattached to the faces of the cubes, one number to each face. The dice are then rolled and the numbers on the two top faces are added. What is the probability that the sum is ?
Solution 1
At the moment when the numbers are in the bag, imagine that each of them has a different color. Clearly the situation is symmetric at this moment. Hence after we draw them, attach them and throw the dice, the probability of getting some pair of colors is the same for any two colors.
There are ways how to pick two of the colors. We now have to count the ways where the two chosen numbers will have a sum of .
A sum of can be obtained as , , or . Each number in the bag has two different colors, hence each of these three options corresponds to four pairs of colors.
Out of the pairs of colors we can get when throwing the dice, will give us the sum . Hence the probability that this will happen is .
Solution 2
Ignoring the numbers that do not affect the probability of the desired outcome (the ones that are not on top of the dice), say that the number on top of the first die is . For the sum of the numbers to be , the second die must have the number on top. There are remaining numbers that could be on top of the second die, of which are (since in all cases).
Thus, the probability of the sum of the numbers being is , so the answer is .
Solution 3
Taking out the rolling dice part, we see that we're just taking 2 numbers out of a bag. There are ways to pick 2, and there are 12 ways to pick one, and 2 ways to pick the other. (After you pick one, the other one you pick is fixed). Now say you pick n. The other number you pick has to be 7-n. But if you picked 7-n first and n second, that would be the same thing. So we need to divide by 2.
This gives or .
See Also
2009 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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.