Diagonal Slices

My friend, Kent Asmussen, invented (and solved!) this problem when he was in ninth grade. Now you get a turn.

If you cut along all of the diagonals of an irregular n-sided convex polygon, what is the largest number of pieces into which you will cut the polygon?

Your answer should be a formula involving n.