返回题库

AIME 1983 · 第 7 题

AIME 1983 — Problem 7

专题
Contest Math
难度
L4
来源
AIME

题目详情

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 PP be the probability that at least two of the three had been sitting next to each other. If PP is written as a fraction in lowest terms, what is the sum of the numerator and denominator?

解析

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 11.

Imagine that the 2222 other (indistinguishable) people are already seated, and fixed into place.

We will place AA, BB, and CC with and without the restriction.

There are 2222 places to put AA, followed by 2121 places to put BB, and 2020 places to put CC after AA and BB. Hence, there are 22212022\cdot21\cdot20 ways to place A,B,CA, B, C in between these people with restrictions.

Without restrictions, there are 2222 places to put AA, followed by 2323 places to put BB, and 2424 places to put CC after AA and BB. Hence, there are 22232422\cdot23\cdot24 ways to place A,B,CA,B,C in between these people without restrictions.

Thus, the desired probability is 1222120222324=1420552=13546=11461-\frac{22\cdot21\cdot20}{22\cdot23\cdot24}=1-\frac{420}{552}=1-\frac{35}{46}=\frac{11}{46}, and the answer is 11+46=05711+46=\boxed{057}.

Solution 2

There are (251)!=24!(25-1)! = 24! 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 (32)=3{3\choose 2} = 3 ways to pick a pair of knights from the trio, and there are 2!=22! = 2 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 (241)!=23!(24-1)! = 23! 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 3!=63! = 6 ways to determine their order, and there are (231)!=22!(23-1)! = 22! configurations.

Thus, the required probability is 2×3×23!6×22!24!=1146\frac{2 \times 3 \times 23! - 6 \times 22!}{24!} = \frac{11}{46}, and the answer is 057\boxed{057}.

Solution 3

Number the knights around the table from 11 to 2525. The total number of ways to pick the knights is

(253)=252423321=25234{25\choose 3} = \frac{25\cdot24\cdot23}{3\cdot2\cdot1} = 25\cdot23\cdot4 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 (1,2,3)(1,2,3), (2,3,4)(2,3,4), (3,4,5)(3,4,5), (4,5,6)(4,5,6), ...,(23,24,25)(23,24,25), (24,25,1)(24,25,1), (25,1,2)(25,1,2). This makes 2525 combinations.

Case 2: Like above, there are 2525 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 (5,6)(5,6), you may not pick 4 or 7.) Thus, there are 254=2125-4=21 ways to pick the third knight, for a total of 252125\cdot21 combinations.

Thus, you have a total of 25+(2521)=252225 + (25\cdot21) = 25\cdot22 allowable ways to pick the knights.

The probability is 252225234=1146\frac{25\cdot22}{25\cdot23\cdot4} = \frac{11}{46}, and the answer is 057\boxed{057}.

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 22 possible places for this out of 2424, so the probability of this is 112\frac{1}{12}. We do not need to consider the third knight.

Case 2: The second knight sits two spaces apart from the first knight. There are 22 possible places for this out of 2424, so the probability is 112\frac{1}{12}. Then there are 33 places out of a remaining 2323 for the third knight to sit, so the total probability for this case is 112×323\frac{1}{12} \times \frac{3}{23}.

Case 3: The second knight sits three or more spaces apart from the first knight. There are 2020 possible places for this out of 2424, so the probability is 56\frac{5}{6}. Then there are 44 places to put the last knight out of 2323, so the total probability for this case is 56×423\frac{5}{6}\times\frac{4}{23}.

Now we add the probabilities to get the total:

112+112×323+56×423=112×123(23+3+40)=6612×23\frac{1}{12}+\frac{1}{12}\times\frac{3}{23}+\frac{5}{6}\times\frac{4}{23}=\frac{1}{12}\times\frac{1}{23}\left(23+3+40\right)=\frac{66}{12\times 23} =6×116×2×23=1146=\frac{6\times 11}{6\times 2 \times 23}=\frac{11}{46} so the answer is 057\boxed{057}.

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 24(23)[2(20)+20(19)]24(23)=1146\frac{24\left(23\right)-\left[2\left(20\right)+20\left(19\right)\right]}{24\left(23\right)}=\frac{11}{46}, so the answer is 11+46=05711+46=\boxed{057}.

Solution 6 (stars and bars)

Let K1,K2,K3K_1, K_2, K_3 be the knights in clockwise order. Let AA be the distance between K1K_1 and K2K_2, BB the distance between K2K_2 and K3K_3 and CC the distance between K3K_3 and K1K_1. A+B+C=25A + B + C = 25 and A,B,C1A, B, C \geq 1. In order to use stars and bars the numbers must be greater than or equal to 0 instead of 1, so we define A1=A1,B1=B1,C1=C1A_1 = A - 1, B_1 = B - 1, C_1 = C - 1. A1+B1+C1=22A_1 + B_1 + C_1 = 22, so by stars and bars there are (22+3131)=276\binom{22 + 3 - 1}{3 - 1} = 276 possibilities.

The condition is not satisfied if A,B,C2A, B, C \geq 2, so we can use complementary counting. Let A2=A2,B2=B2,C2=C2A_2 = A - 2, B_2 = B - 2, C_2 = C - 2. A2+B2+C2=19A_2 + B_2 + C_2 = 19, and by stars and bars there are (19+3131)=210\binom{19 + 3 - 1}{3 - 1} = 210 possibilities. This means there are 276210=66276 - 210 = 66 possibilities where the condition is satisfied, so the probability is 1146\frac{11}{46}, resulting in 057\boxed{057}.

Solution 7

There are (253)=25242332=2300\binom{25}{3}=\frac{25 \cdot 24 \cdot 23}{3 \cdot 2}=2300 ways to chose 33 knights out of 2525 knights.

To ensure at least 22 adjacent knights are chosen, first choose 11 of the 2525 pairs of adjacent knights. After choosing the adjacent pair of knights, there are 2323 ways to choose the third knight. There are 2525 choices of 33 knights sitting consecutively, which are counted twice. For example, choosing (1,2)(1,2) first, then choosing 33 is the same as choosing (2,3)(2,3) first, then choosing 11. Therefore, there are 252325=55025 \cdot 23 -25=550 ways to choose 33 knights where at least 22 of the 33 had been sitting next to each other.

P=5502300=1146P=\frac{550}{2300}=\frac{11}{46} The answer is 11+46=05711+46=\boxed{\textbf{057}}

~isabelchen

Solution 8

There are two possible scenarios satisfying this condition, one where two knights sit next to each other, while the third knight is lonely, and the other is where all three knights sit next to each other. On the numerator will be the total number of ways to position the knights, and on the denominator will be the number of ways to choose three knights.

Denominator: (253)\binom{25}{3} ways to choose three knights

Numerator:

    \implies Case1:Case_1: Two knights are next to each other, third is lonely :(

2525 ways to situate two knights, 2121 ways for third knight

    \implies Case2:Case_2: All three knights are next to each other

2525 ways

So, we have P=2125+25(253)P = \frac{21 \cdot 25+25}{\binom{25}{3}} =22256252423= \frac{22 \cdot 25 \cdot 6}{25 \cdot 24 \cdot 23} =1146= \frac{11}{46}, and our answer is 11+46=05711+46=\boxed{057}

~mineric (formatted shalomkeshet)

Solution 9

Lets use complementary counting. First, we must find the probability that no 33 chosen people are sitting next to each other. We claim that if there are nn people around the circle, and kk chosen people, this probability is simply

nk(nk1k1)\dfrac{n}{k}\dbinom{n-k-1}{k-1} Now, we can just plug it in to get a total of 17501750 ways. The denominator is simply (253)=2300\dbinom{25}{3}=2300. Now, our probability is simply 17502300\dfrac{1750}{2300}. But, this is the opposite of what we want. We want 117502300=11460571-\dfrac{1750}{2300} = \dfrac{11}{46} \Longrightarrow \boxed{057}.

-jb2015007