This is the last of this week’s excursions into pizzas and cakes. In essence, these questions have been about the partitioning of two- and three-dimensional figures, so let’s abandon the culinary analogies for this one.

Take a circle and distribute n distinct points around its circumference. Join each point to every other point with a chord. The circle has thus been partitioned into a number of non-overlapping regions. Let R(n) be the maximum number of regions that can be created.

Given that R(n) is a quartic polynomial, or otherwise, find R(n) and hence calculate R(10).

**Feel free to comment, ask questions and even check your answer in the comments box below powered by**~~Disqus~~ Google+.

**}**

**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.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.