This is an extension to the earlier Pizza Slices problem. Let’s assume that a pizza is a flat two-dimensional circle. A cut is a straight-line chord that splits the circle into two regions; thereby creating two slices of pizza. We cannot rearrange the slices between each cut.
What is the general formula for the maximum number of pieces of pizza from N straight-line cuts?
[Edited to 20 cuts to match the G+ posts - as there are no answers as yet, I hope this is not a problem.]
This space is here to avoid seeing the answers before trying the problem!
If you enjoy using this website then please consider making a donation - every little helps :-)
You can receive these questions directly to your email box or read them in an RSS reader. Subscribe using the links on the right.
Don’t forget to follow Gifted Mathematics on Google+, Facebook or Twitter. You may add your own interesting questions on our Google+ Community and Facebook..
You can also subscribe to our Bookmarks on StumbleUpon and Pinterest. Many resources never make it onto the pages of Gifted Mathematics but are stored in these bookmarking websites to share with you.