This question already has an answer here:
Suppose that $n$ lines are drawn on a plane in such a way that no lines are parallel and no three of them intersect at a point. Let $r(n)$ be the number of regions the plane is divided into after drawing the $n$ lines. Find a recursive formula and prove it without induction.
I found that the formula $r(n)=r(n-1) + n$ works but am having trouble proving it.