Stanford Math Tournament , which is held on February 14th. Then, towards the end, he realizes that he has a date in the evening! (He completely forgot while preparing for the tournament.)
Alex is having a great time at theGiven the time the tournament ends and the speed at which Alex drives (which is not very fast), he can reach the restaurant where he is supposed to have his date some time between 6:45PM and 7:15 PM.
Unfortunately, he also forgot what time his date should start. All he knows that his date will arrive at the restaurant sometime between 6:30PM and 7:00PM.
Also, Alex knows that his date is impatient and will leave if she has to wait more than 6 minutes for Alex to arrive. As for Alex, he'll wait 12 minutes, and if his date doesn't arrive, he leaves, even if she comes later.
Being an avid math fan, Alex wants to know the probability that he meets with his date. If this probability is represented by for some relatively prime positive integers and , find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Since we are dealing with time rather than discrete numbers, we use geometry. On the coordinate plane, let the x -axis represent the time at which Alex arrives, the y -axis represent the time at which his date arrives, and the origin represent 6 : 3 0 for both axes. Also, one unit equals one minute.
From the condition that Alex will wait no more than 1 2 minutes, we get the inequality y ≤ x + 1 2 . From the condition that his date will wait no more than 6 minutes, we get the inequality y ≥ x − 6 . We also have 0 ≤ y ≤ 3 0 , since Alex's date arrives between 6 : 3 0 and 7 : 0 0 . Similarly, 1 5 ≤ x ≤ 4 5 , since Alex arrives between 6 : 4 5 and 7 : 1 5 .
The graph of these inequalities is shown below. The square region marked by the black points represents the total possible ordered pairs, and the dark blue region within this region represent our desired cases.
Now, we just find the area of the blue region to the total square region. Let A = ( 1 5 , 3 0 ) . The line y = x + 1 2 intersects y = 3 0 at B ( 1 8 , 3 0 ) and x = 1 5 at C ( 1 5 , 2 7 ) . The line y = x − 6 intersects y = 3 0 at D ( 3 6 , 3 0 ) and x = 1 5 at E ( 1 5 , 9 ) . The area of the blue region is then
[ B D E C ] = [ A D E ] − [ A B C ] = 2 ( A D ) ( D E ) − 2 ( A B ) ( A C ) = 2 2 1 2 − 2 3 2 = 2 1 8 ( 2 4 ) = 2 1 6 .
The area of the square region is just 3 0 2 = 9 0 0 . Thus, our probability is 9 0 0 2 1 6 = 2 5 6 , so m + n = 6 + 2 5 = 3 1 .
(The moral of this story: Never have a math contest on the same day as Valentine's Day!)
UPDATE: Unfortunately, SMT has been canceled. It has been replaced by a new contest called ASMT, which is in the same format as the SMT.