MMM #32 Winner

mmmwin.jpg

The winner for the last MMM at Blinkdagger is Sander Land. A lot of you mistook this problem for the classic bridge/flashlight problem, but it was actually a little more complicated than that one. You can view the problem statement here. As mentioned previously, this is the last MMM to be conducted here at blinkdagger. We appreciate everyone for participating in this contest. It was a lot of fun while it lasted and we hope that there will be many new puzzles to solve over at wildaboutmath.com! Good luck to all!

The Answer by Sander Land

First, simply consider a general strategy for crossing the bridge.
It is clear that
- both Daniel and Quan need to use the bike at some point
- Sol needs to be the one to transfer the bike from one of them to the other.

This leaves a strategy like:
- Daniel takes the bike from the start to point x1, dismounting, and
continues to walk.
- Sol walks to point x1, and takes the bike back to point x2, and
walks to the end point.
- Quan walks to point x2, picks up the bike, and bikes to the end.

Taking into account the fact that any solution which has
- one of them arrive earlier than the others or
- one of them waiting at any time (including t=0)
can be improved, and normalizing the length of the bridge to 1, the
equations for this are:

D: x1 + 15*(1-x1) = T
Q: 8*x2 + (1-x2) = T
S: 3 + 4*(x1-x2) = T (i.e. walking the entire length, and
both walking and biking x1-x2)

Which matlab can help us solve:
>> D=15; Q=8; S=3;
>> R=[-D -1 -S]‘
>> A=[-(D-1) 0 -1 ; 0 (Q-1) -1 ; (S+1) -(S+1) -1]
>> A\R
0.7692 => x1 is at 77% of the bridge length
0.4615 => x2 is at 46% of the bridge length
4.2308 => They can cross the bridge in about 4 minutes and 14 seconds.

The other possible strategy (Quan starts on the bike) can also be
tried by simply switching Daniel and Quan’s velocities. This results
in the same shortest time.
>> D=8; Q=15; S=3;
0.5385
0.2308
4.2308