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
Four lines give at most 6 crossing points. Parallel lines and three lines through one point reduce that. Every count from 0 to 6 can happen except 2.
Solution
Most points possible. Every two lines cross at most once. Four lines make pairs (with lines : ), so there are at most crossing points.
There are only two ways to lose points:
- two lines are parallel, so that pair never meets;
- three or more lines pass through the same point, so several pairs share one point.
Which counts can happen? Sketch each one.
- : four lines in general position, no two parallel and no three through one point.
- : two parallel lines, plus two other lines that cross each other away from them. Each of the two other lines crosses both parallels ( points), and they cross each other ( more).
- : two pairs of parallel lines, like a tic-tac-toe board with only lines.
- : three parallel lines and one line crossing all of them.
- : all four lines through one point.
- : all four lines parallel.
Why is impossible. Suppose there are exactly two crossing points.
- First, suppose three of the lines pass through one point . The fourth line is parallel to at most one of those three, so it crosses at least two of them. If it misses , those crossings are two new points, making at least in all. If it goes through , all four lines meet at and . Either way, not .
- Now suppose no three lines share a point. Then each crossing point comes from just one pair, so only pairs cross and the other pairs are parallel. Look at how parallel lines can group: all four parallel gives parallel pairs; three parallel and one other gives ; two groups of two gives ; one parallel pair gives . None of these gives exactly . So this cannot happen either.
The possible values are , and their sum is .
The answer is .
Why this works
Start from the most points possible and ask exactly how points get lost: parallel pairs or several lines through one point. Drawing examples for the values that work is quick. The real work is showing that the one missing value, , can never happen, instead of assuming your list is complete.
The trap
Assuming every count from 0 to 6 is possible (sum 21) without checking whether exactly 2 crossing points can happen.
Concise 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 .
Review in the AoPS books
- Introduction to Geometry, Chapter 2: Angles
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
Techniques
Organized listing / direct enumeration · Split into exhaustive cases and handle each