Hello, I am trying to follow an example/explanation, but with no luck. Here is the question: Let n be the number of cuts and let an be the maximum number of pieces. Now it is clear that a0 = 1 and a1 = 2. Since we want to maximize the number of pieces, we ensure that two cuts cross. Hence, a2 = 4. (Now here is the part in the example where I get confused): Similarly, a third cut should cross both of the previous two, but not where they cross each other. This yields a3 = 7. How did they do that? I don't understand. Wait a minute, I think I do understand how they did it. But, the pieces couldn't be equal could they? Is it possible to make three cuts, get seven pieces, but have all seven pieces equal? The example goes further: Suppose n - 1 cuts have been made and an - 1 pieces are obtained. As before, the n-th cut should cross each of the others at distinct points. Hence there will be n - 1 points of intersection on it, dividing it into n segments. Each segment cuts an existing piece into two. Hence we get the recurrence relation an = an - 1 + n, 1 <= n a0 = 1. Ok. I didn't understand this part. Could someone reword this for me if it isn't too much trouble? I can't see what they are saying as of yet. Any help is appreciated. Thankyou.