Maths WorkshopMaths problems with full solutions
Exercise 604Combinatorics › Counting principlesM1Added 4 Nov 2026

Regions cut by n lines

#induction#counting#lines in the plane

Statement

nn lines are drawn in the plane so that no two are parallel and no three pass through a common point. Prove that they divide the plane into n2+n+22\dfrac{n^2+n+2}2 regions.

Hint

Add the lines one at a time and count how many new regions the last line creates.

Show solutionHide solution

Solution

Idea. Let RnR_n be the number of regions. Compare Rn+1R_{n+1} and RnR_n.

Induction. For n=0n=0 there is one region, and 0+0+22=1\frac{0+0+2}2=1.

Suppose the formula holds for nn lines and add an (n+1)(n+1)-th line ℓ\ell. It crosses each of the nn existing lines at nn distinct points. These nn points cut ℓ\ell into n+1n+1 pieces.

Each piece lies inside one existing region and splits it into two. Thus exactly n+1n+1 new regions are created:
Rn+1=Rn+n+1.R_{n+1}=R_n+n+1.

Computation.
n2+n+22+n+1=(n+1)2+(n+1)+22,\frac{n^2+n+2}2+n+1=\frac{(n+1)^2+(n+1)+2}2,
which is the formula for n+1n+1.

Remark. Equivalently Rn=1+(n1)+(n2)R_n=1+\binom n1+\binom n2.

Lesson. To count regions or objects built incrementally, count the change produced by the last object added.