Let be a positive integer. Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly distinct points.
Solution
Let be the integer so that . Then since lines intersect in at most points, we have . We shall show that there exist lines that intersect in exactly points. Let and .
Case (i): is even. Draw pairs of lines so that they intersect in distinct points on the -axis. Draw another lines, not parallel to the -axis, so that the lines are pairwise nonparallel. Then draw another line on the -axis. These lines intersect in exactly points.
Case (ii): is odd. Draw pairs of lines so that they intersect in distinct points on the -axis. Draw another lines so that exactly one of them is parallel but not on the -axis, and that the lines are pairwise nonparallel. Then draw another line on the -axis. These lines intersect in exactly points.
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.