🚀 go-pugleaf

In article <C0HD3p.1u4@dcs.ed.ac.uk>, tk@dcs.ed.ac.uk (Tommy Kelly) writes:
|> Every morning, I take a train to the city, then have to take a bus to
|> Uni.  There are two bus stops within easy walking distance of the train
|> station.
|> 
|> Bus stop 1 is 4mins 20 seconds away, and is the earlier on the route (the bus
|> visits it before bus stop 2).
|> 
|> Bus stop 2 is 3mins 20 seconds away.
|> 
|> The bus takes about 30 seconds to travel from stop 1 to stop 2.
|> 
|> Bus interarrival time is 15 minutes, and can effectively be at any point
|> in their run when I begin my walk from the train station.
|> 
|> a. On average, which bus stop should I walk to minimize my time in travelling
|>    to the University?

Bus stop 2
 
|> b. In general, for times :
|> 	Tn - time to walk to stop n
|> 	dn - time for bus to travel from stop n to stop n+1
|> 	l  - bus interarrival time
|> 
|> 	which stop should I choose?

The one that maximises Sum(d1...dn) - Tn

-- 
stein.kulseth@nta.no (Norwegian Telecom Research)
   'When murders are committed by mathematics, they can be solved by
   mathematics. Most of them aren't, and this one wasn't'
   - Nick Charles (Dashiell Hammett's "The Thin Man")