2015 AIME I Problems/Problem 2
Problem
The nine delegates to the Economic Cooperation Conference include officials from Mexico, officials from Canada, and officials from the United States. During the opening session, three of the delegates fall asleep. Assuming that the three sleepers were determined randomly, the probability that exactly two of the sleepers are from the same country is , where and are relatively prime positive integers. Find .
Solution
The total number of ways to pick officials from total is , which will be our denominator. Now we can consider the number of ways for exactly two sleepers to be from the same country for each country individually and add them to find our numerator:
- There are different ways to pick delegates such that are from Mexico, simply because there are "extra" delegates to choose to be the third sleeper once both from Mexico are sleeping.
- There are ways to pick from Canada, as each Canadian can be left out once and each time one is left out there are "extra" people to select one more sleeper from.
- Lastly, there are ways to choose for the United States. It is easy to count different ways to pick of the Americans, and each time you do there are officials left over to choose from.
Thus, the fraction is . Since this does not reduce, the answer is .
Solution 2
The total number of ways to pick officials from total is . We note that two sleepers are asleep and one is awake if and only if the sleepers come from two distinct countries. The sleeping officials can be from either , , or countries.
- If the sleeping officials are from a single country, they can be from Canada in way and from the United States in ways, so there are total possibilities.
- If the sleeping officials are from different countries, there must be one from each. So there are total possibilities.
Out of total, possibilities are different from the case we are looking for, so there are total ways to choose 22 officials from one country and a single official from another country. As and share no common factors, we have .
Solution 3
The first thing we need to do is to figure out the total number of ways we can pick the 3 delegates that fell asleep. We can do this using combinations: .
See also
2015 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.