MathCastle
Proof WritingChallengeWriting It Up

Writing It Up · Challenge problem

Look back at the lines problem: nn lines cut the plane into R(n)=1+n(n+1)2R(n) = 1 + \tfrac{n(n + 1)}{2} regions. The same method in space: nn planes in general position cut space into C(n)C(n) pieces, where the nn-th plane is itself cut by the others into R(n−1)R(n - 1) regions. How many pieces do 66 planes make?