Let’s take a spherical cake, somewhat like the Jupiter layer cake in the image, and each planar knife cut slices the cake into two pieces. We’ve met this problem before, but beyond 4 or 5 slices trying to think geometrically can be a brain ache - unless you are gifted in spatial reasoning! However, the general formula for the maximum number of pieces N(p) after p cuts is just a cubic polynomial. Find this general formula and solve the problem!
[Note that the Jupiter Cake is for real and can be found at Cakecrumbs.]
[Note 2. The slice taken in the diagram, showing the inner layers, is not a planar cut.]
Feel free to comment, ask questions and even check your answer in the comments box below powered by
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.