Section 1.

2, Problem 42 The key to this problem is the assumption that the vehicles leaving the area during the hour were exactly the same as those entering it. At the end of the hour, there are no cars left over, in any of the streets or intersections. That means that the number entering each intersection must equal the number leaving. This gives four equations (labeling the unknowns clockwise from top): a + 100 + b = 250 120 + 150 = b + c c + 300 = 320 + d d + 300 = 400 + a Since the streets are one-way, we have additional restrictions: a 0, b 0, c 0, d 0. The solution has one free parameter, r: 0 a = 100 + r 0 b = 250 r 0 c = 20 + r 0d=r The inequalities are all satised as long as r 100 and r 250. Plug this in to get the ranges of a, b, c and d: 0 a 150 0 b 100 120 c 270 100 d 250.