In a certain city there are straight streets, such that every two streets intersect, and no three streets pass through the same intersection. The City Council wants to organize the city by designating the main and the side street on every intersection. Prove that this can be done in such way that if one goes along one of the streets, from its beginning to its end, the intersections where this street is the main street, and the ones where it is not, will appear in alternating order.
Problem 1787
Official solution
Solution:
Pick any street and organize the intersections along such that the intersections of the two types alternate, as in the statement of the problem.
On every other street , exactly one intersection has been organized, namely the one where intersects . Call this intersection . We want to organize the intersections along such that they alternate between the two types. Note that, as is already organized, we have exactly one way to organize the remaining intersections along .
For every street , we can apply the procedure described above. Now, we only need to show that every intersection not on is well-organized. More precisely, this means that for every two streets intersecting at , is the main street on if and only if is the side street on .
Consider also the intersections and . Now, we will define the "role" of the street at the intersection as "main" if this street is the main street on , and "side" otherwise. We will prove that the roles of and at are different.
Consider the path . Let the number of intersections between and be , the number of these between and be , and the number of these between and be . Now, if we go from to , we will change our role times, as we will encounter new intersections. Then, we will change our street from to , changing our role once more. Then, on the segment , we have new role changes, and after that one more when we change our street from to . The journey from to will induce new role changes, so in total we have changed our role , As we try to show that roles of and differ, we need to show that the number of role changes is odd, i.e. that is odd.
Obviously, this claim is equivalent to . But and count the number of intersections of the triangle with streets other than . Since every street other than intersects the sides of in exactly two points, the total number of intersections is even. As a consequence, as required.