1983 AIME Problems/Problem 7
Problem
Twenty five of King Arthur's knights are seated at their customary round table. Three of them are chosen - all choices being equally likely - and are sent off to slay a troublesome dragon. Let be the probability that at least two of the three had been sitting next to each other. If is written as a fraction in lowest terms, what is the sum of the numerator and denominator?
Contents
Solution
Solution 1
We can use complementary counting, by finding the probability that none of the three knights are sitting next to each other and subtracting it from .
Imagine that the other (indistinguishable) people are already seated, and fixed into place.
We will place , , and with and without the restriction.
There are places to put , followed by places to put , and places to put after and . Hence, there are ways to place in between these people with restrictions.
Without restrictions, there are places to put , followed by places to put , and places to put after and . Hence, there are ways to place in between these people without restrictions.
Thus, the desired probability is , and the answer is .
Solution 2
There are configurations for the knights about the table (since configurations that are derived from each other simply by a rotation are really the same, and should not be counted multiple times).
There are ways to pick a pair of knights from the trio, and there are ways to determine in which order they are seated. Since these two knights must be together, we let them be a single entity, so there are configurations for the entities.
However, this overcounts the instances in which the trio sits together; when all three knights sit together, then two of the pairs from the previous case are counted. However, we only want to count this as one case, so we need to subtract the number of instances in which the trio sits together (as a single entity). There are ways to determine their order, and there are configurations.
Thus, the required probability is , and the answer is .
Solution 3
Number the knights around the table from to . The total number of ways to pick the knights is There are two possibilities: either all three sit next to each other, or two sit next to each other and one is not sitting next to the other two.
Case 1: All three sit next to each other. In this case, you are picking , , .... This makes combinations.
Case 2: Like above, there are ways to pick the pair of knights sitting next to each other. Once a pair is picked, you cannot pick either of the two adjacent knights. (For example, if you pick , you may not pick 4 or 7.) Thus, there are ways to pick the third knight, for a total of combinations.
Thus, you have a total of allowable ways to pick the knights.
The probability is , and the answer is .
Solution 4
Pick an arbitrary spot for the first knight. Then pick spots for the next two knights in order.
Case 1: The second knight sits next to the first knight. There are possible places for this out of , so the probability of this is . We do not need to consider the third knight.
Case 2: The second knight sits two spaces apart from the first knight. There are possible places for this out of , so the probability is . Then there are places out of a remaining for the third knight to sit, so the total probability for this case is .
Case 3: The second knight sits three or more spaces apart from the first knight. There are possible places for this out of , so the probability is . Then there are places to put the last knight out of , so the total probability for this case is .
Now we add the probabilities to get the total:
so the answer is .
Solution 5
We simplify this problem by using complementary counting and fixing one knight in place. Then, either a knight can sit two spaces apart from the fixed knight, or a knight can sit more than two spaces apart from the fixed knight. The probability is then , so the answer is .
See Also
1983 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |