After riding the bike many days on the same roads, I came to the following interesting exercise: find a speed, such that you can reach your destination with this speed without having to stop at a red light. Of course we assume, that we always stop at red light.
So the exercise is the following. Consider a finite number of traffic lights, 
, and suppose that the bike rider starts when 
becomes green. Then let 
be the times for which the respective lights are green, and 
be the times for which the lights are red. Further, let 
be the distances between the lights, and suppose that we know at t = 0 the remaining green or red time for every light. Let these times be 
with positive times for remaing green and negative for remaining red time. Determine the set of all possible constant speeds (also unrealistic) for which the rider can pass through without having to stop.
P.S. 
could be any n-tuple from ![\{(x_1,\ldots,x_n)|x_i \in [-F_i,T_i] \}](http://blog.alex-droseltis.net/wp-content/plugins/latex/cache/tex_71526b4168960672eb02399d212231ff.gif)
P.S.2 He he, it is easy to find some trivial funny unrealistic solutions. But we want all solutions!
