Maths Olympiad Prep

Library / /21 of 80

Geometry Difficulty 4.5 AIME Prove it North Macedonia

2n2n (n>1n > 1) points are given in the plane. Line pp lies in the plane and does not cross the given points. Prove that this line cuts no more than n2n^2 segments with end in the given points.

Solution

Let the given points and the line be lying in the plane π\pi. The line pp is dividing the plane into the two half-planes π1\pi_1 and π2\pi_2. If in one of the half-planes lies mm points, then in the other lies 2nm2n - m points. A segment with endpoints in the same half-plane does not cut with the line. The line cuts only the segments with endpoints in the different half-planes. The number of these segments is m(2nm)m(2n - m). Because n2m(2nm)=n22nm+m2=(nm)20n^2 - m(2n - m) = n^2 - 2nm + m^2 = (n - m)^2 \ge 0, we have n2m(2nm)n^2 \ge m(2n - m). This means that the line is cutting no more than n2n^2 segments.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

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