Maths Olympiad Prep

Track / Stage 6 / 307 of 400 #1787 of 2444

Problem 1787

National Olympiad, first round
Geometry Difficulty 6.6 Prove it Junior Balkan Mathematical Olympiad Shortlist · JBMO

In a certain city there are nn 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.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

Pick any street ss and organize the intersections along ss such that the intersections of the two types alternate, as in the statement of the problem.

On every other street s1s_{1}, exactly one intersection has been organized, namely the one where s1s_{1} intersects ss. Call this intersection I1I_{1}. We want to organize the intersections along s1s_{1} such that they alternate between the two types. Note that, as I1I_{1} is already organized, we have exactly one way to organize the remaining intersections along s1s_{1}.

For every street s1ss_{1} \neq s, we can apply the procedure described above. Now, we only need to show that every intersection not on ss is well-organized. More precisely, this means that for every two streets s1,s2ss_{1}, s_{2} \neq s intersecting at s1s2=As_{1} \cap s_{2}=A, s1s_{1} is the main street on AA if and only if s2s_{2} is the side street on AA.

Consider also the intersections I1=s1sI_{1}=s_{1} \cap s and I2=s2sI_{2}=s_{2} \cap s. Now, we will define the "role" of the street tt at the intersection XX as "main" if this street tt is the main street on XX, and "side" otherwise. We will prove that the roles of s1s_{1} and s2s_{2} at AA are different.

Consider the path AI1I2AA \rightarrow I_{1} \rightarrow I_{2} \rightarrow A. Let the number of intersections between AA and I1I_{1} be u1u_{1}, the number of these between AA and I2I_{2} be u2u_{2}, and the number of these between I1I_{1} and I2I_{2} be vv. Now, if we go from AA to I1I_{1}, we will change our role u1+1u_{1}+1 times, as we will encounter u1+1u_{1}+1 new intersections. Then, we will change our street from s1s_{1} to ss, changing our role once more. Then, on the segment I1I2I_{1} \rightarrow I_{2}, we have v+1v+1 new role changes, and after that one more when we change our street from s1s_{1} to s2s_{2}. The journey from I2I_{2} to AA will induce u2+1u_{2}+1 new role changes, so in total we have changed our role u1+1+1+v+1+1+u2+1=u1+v+u2+5u_{1}+1+1+v+1+1+u_{2}+1=u_{1}+v+u_{2}+5, As we try to show that roles of s1s_{1} and s2s_{2} differ, we need to show that the number of role changes is odd, i.e. that u1+v+u2+5u_{1}+v+u_{2}+5 is odd.

Obviously, this claim is equivalent to 2u1+v+u22 \mid u_{1}+v+u_{2}. But u1,vu_{1}, v and u2u_{2} count the number of intersections of the triangle AI1I2A I_{1} I_{2} with streets other than s,s1,s2s, s_{1}, s_{2}. Since every street other than s,s1,s2s, s_{1}, s_{2} intersects the sides of AI1I2A I_{1} I_{2} in exactly two points, the total number of intersections is even. As a consequence, 2u1+v+u22 \mid u_{1}+v+u_{2} as required.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.