"What is the maximal number of regions that can be obtained by joining n points around a circle by straight lines? The first few values of this sequence are 1,2,4,8,16,... Here's a hint: the next value is not 32."
Hope that nobody will take offence if I use this space as a journal of my thoughts on this problem:
- The next value in the sequence is 31, intriguingly.
- If there are distinct points around the circle, the number of chords is .
- Having seen that enumerating intersections was useful in a previous simpler but similar problem (see https://nrich.maths.org/discus/messa...tml?1248745070), I have been trying to enumerate the number of intersections that do *not* occur on the circumference of the circle. (Clearly, there are chords between adjacent points, which create regions: regions closest to the circumference, and one central region. I hope that if I can enumerate the number of intersections that occur within the circle, I can deduce how this affects the division of this central region.) If we label a point on the circle , and work our way around the circle in one direction only, we may label the subsequent points . I will use the and symbols to denote position with respect to this order, with defined to be the least member.
The chord linking the points and I will denote . Suppose that the chord intersects with the chord where within the circle; then must adhere to the following:
and ( or ).
But how to enumerate these internally intersecting chords? I suppose that the points and in the above intersecting chord must not be adjacent. There are of qualifying chords that may play the role of . I suppose that I could enumerate the number of such pairs of chords (and therefore the number of internal intersections), noting that the intersecting chord pair will be counted twice in the calculation, since it may play the role as either or the role of .
I'm not sure if any of the last paragraph will make much sense to anyone else, but I hope that it will to me in the morning, when I shall think about this some more...
Any thoughts, or hints much appreciated.