As I was working away at an assignment today, a group of freshmen were discussing a counting problem nearby which I ended up hearing about. Since I found it interesting, I thought I might just share it with you all.

So we start by considering a circle and, for each consider evenly spaced points along the circle and all the possible segments between them (i. e. as in a complete graph). Now, the question is, how many regions (say ) does this procedure split the circle into?

As a starting point, the following diagram shows the figures obtained for

With this, we may see that and so on and so forth.

### Like this:

Like Loading...

*Related*

I will just add that so all the excitement of is gone :(. Still don’t have a convincing proof for the temptative formula I have, though.

I am wondering…. is a_4 correct? I am only able to count 6 not 8…

Oh, sorry about that, somehow the left and bottom segments got erased when uploading the picture (which would create the two regions you’re missing). But, as the problem states,

allthe segments should be included when drawing out the picture.