The geometric approach is the cleanest way to do this.
Model the problem geometrically by plotting arrival times on a 2D plane, where the total area represents all possible arrival pairs. Identify the region where the absolute difference in arrival times is at most 15 minutes, and compute its area relative to the total area.
Pro tip: After calculating the probability, briefly discuss how the result would change if the waiting time were different, or if the arrivals were not uniform, to show deeper understanding and adaptability.
Let X and Y be the arrival times of the two people, each uniformly distributed between 0 and 60 minutes. The sample space is the square [0,60] x [0,60] with area 3600.
They meet if |X - Y| <= 15. This defines a band around the line Y = X in the square.
The area of the band is the total square area minus the areas of the two triangles where |X - Y| > 15. Each triangle has legs of length 45, so area = 0.5 * 45 * 45 = 1012.5. Total non-meeting area = 2025, so meeting area = 3600 - 2025 = 1575.
Probability = meeting area / total area = 1575 / 3600 = 0.4375 or 43.75%.
Check that the probability is reasonable (less than 50% because the waiting time is a quarter of the window). Optionally, generalize to waiting time w: P = 1 - (1 - w/60)^2.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.