JMO 2000 Problem 5
Finitely many lines are given in a plane. We call an intersection point a point that belongs to at least two of the given lines, and a good intersection point a point that belongs to exactly two lines. Assuming there at least two intersection points, find the minimum number of good intersection points.
Dataset text AoPS wiki problems. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.