返回题库

AIME 1998 · 第 9 题

AIME 1998 — Problem 9

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Two mathematicians take a morning coffee break each day. They arrive at the cafeteria independently, at random times between 9 a.m. and 10 a.m., and stay for exactly mm minutes. The probability that either one arrives while the other is in the cafeteria is 40%,40 \%, and m=abc,m = a - b\sqrt {c}, where a,b,a, b, and cc are positive integers, and cc is not divisible by the square of any prime. Find a+b+c.a + b + c.

解析

Solution

Solution 1

Let the two mathematicians be M1M_1 and M2M_2. Consider plotting the times that they are on break on a coordinate plane with one axis being the time M1M_1 arrives and the second axis being the time M2M_2 arrives (in minutes past 9 a.m.). The two mathematicians meet each other when M1M2m|M_1-M_2| \leq m. Also because the mathematicians arrive between 9 and 10, 0M1,M2600 \leq M_1,M_2 \leq 60. Therefore, 60×6060\times 60 square represents the possible arrival times of the mathematicians, while the shaded region represents the arrival times where they meet.

AIME diagram

It's easier to compute the area of the unshaded region over the area of the total region, which is the probability that the mathematicians do not meet:

(60m)2602=0.6\frac{(60-m)^2}{60^2} = 0.6 (60m)2=3660(60-m)^2 = 36\cdot 60 60m=121560 - m = 12\sqrt{15} m=601215\Rightarrow m = 60-12\sqrt{15}

So the answer is 60+12+15=08760 + 12 + 15 = 087.

Solution 2

Case 1:

AIME diagram

Case 2:

AIME diagram

We draw a number line representing the time interval. If mathematician M1M_1 comes in at the center of the time period, then the two mathematicions will meet if M2M_2 comes in somewhere between mm minutes before and after M1M_1 comes (a total range of 2m2m minutes). However, if M1M_1 comes into the cafeteria in the first or last mm minutes, then the range in which M2M_2 is reduced to somewhere in between mm and 2m2m.

We now try to find the weighted average of the chance that the two meet. In the central 602m60-2m minutes, M1M_1 and M2M_2 have to enter the cafeteria within mm minutes of each other; so if we fix point M1M_1 then M2M_2 has a 2m60=m30\frac{2m}{60} = \frac{m}{30} probability of meeting.

In the first and last 2m2m minutes, the probability that the two meet ranges from m60\frac{m}{60} to 2m60\frac{2m}{60}, depending upon the location of M1M_1 with respect to the endpoints. Intuitively, the average probability will occur at 32m60=m40\frac{\frac{3}{2}m}{60} = \frac{m}{40}.

So the weighted average is:

m30(602m)+m40(2m)60=40100\frac{\frac{m}{30}(60-2m) + \frac{m}{40}(2m)}{60} = \frac{40}{100} 0=m2602m+240 = \frac{m^2}{60} - 2m + 24 0=m2120m+14400 = m^2 - 120m + 1440

Solving this quadratic, we get two roots, 60±121560 \pm 12\sqrt{15}. However, m<60m < 60, so we discard the greater root; and thus our answer 60+12+15=08760 + 12 + 15 = 087.

Video Solution

~MaPhyCom