OJ Board

The proof is by mathematical induction: f(n) = the maximum number of pieces with n cuts Proof: suppose we know f(n - 1) now consider f(n): if we remove the nth cut we know the answer by the hypothesis. The question is how to add the nth cut and gain the maximum number of pieces. It's obvious that th...