Induction · Challenge problem

"Claim": $n$ lines in general position (no two parallel, no three through a point) divide the plane into $2^n$ regions. True for $n = 1, 2$. "Step": the new line cuts every region in two. What is the smallest $n$ for which the claim is false?