For a set of four distinct lines in a plane, there are exactly distinct points that lie on two or more of the lines. What is the sum of all possible values of ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Six pairs of lines give at most 6 points; parallel pairs and concurrent triples remove points. Every count from 0 to 6 is achievable except 2.
Solution
Four lines form pairs, and each pair contributes at most one point, so . Points are lost when a pair is parallel (no point) or when three or more lines pass through the same point (several pairs share one point). Organize by how many lines are mutually parallel.
- : four lines in general position.
- : two parallel lines plus two crossing lines, meeting away from the parallels ().
- : two pairs of parallel lines (a parallelogram), or three concurrent lines plus a fourth line crossing all of them.
- : three parallel lines and one transversal; or three concurrent lines plus a line parallel to one of them.
- : all four lines through one point.
- : all four parallel.
Why not ? With two points, every pair of lines is parallel or meets at one of those two points. If some three lines are concurrent at , the fourth line meets at least two of them (it is parallel to at most one), producing at least two more points unless it also passes through , which gives . If no three lines are concurrent, each point accounts for exactly one pair, so only two of the six pairs meet and the other four are parallel; but with four lines, four parallel pairs force all four lines parallel (or three parallel plus one, which gives three points), a contradiction.
Possible values: , with sum .
The answer is .
Why this works
Start from the maximum and understand the only two ways to lose intersections: parallelism (a pair contributes nothing) and concurrency (several pairs collapse to one point). Sketching each configuration is fast; the real content is proving the one missing value impossible rather than assuming the list is complete.
The trap
Assuming every value from 0 through 6 occurs (sum 21) without checking that 2 intersection points is impossible.
Common mistakes
- Assuming every value from 0 through 6 occurs (sum 21) without checking that 2 intersection points is impossible.
- Missing configurations like three concurrent lines plus a parallel line () and concluding is impossible, which gives .
Techniques
Organized listing / direct enumeration · Split into exhaustive cases and handle each