Points Round a Circle
The puzzle
Mark n points round a circle and join every pair with a straight line, with no three lines meeting at one point. Count the regions the circle is cut into.
For 1, 2, 3, 4 and 5 points the answers are 1, 2, 4, 8 and 16. What does 6 points give?
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Draw the six-point case and count carefully. It is not 32.
Hint 2
Each new region is created by a crossing or by a chord. Count both: the crossings are choices of 4 points, the chords are choices of 2.
Show the answer Hide the answer
31, not 32. The doubling is a coincidence that ends at five points.
How to get there
Start with the whole disc as one region. Each chord drawn adds one region, and each crossing inside adds one more, because a chord crossed k times is cut into k+1 pieces and each piece splits a region.
A crossing is determined by four points - the two chords use four endpoints - so the number of crossings is "choose 4 from n". A chord is determined by two points, so the number of chords is "choose 2 from n". The total is 1 + C(n,2) + C(n,4).
For n = 6 that is 1 + 15 + 15 = 31. The sequence runs 1, 2, 4, 8, 16, 31, 57, 99 - it looks like powers of two for exactly as long as C(n,4) happens to agree, and then it does not. Five data points agreeing with a guess is not evidence of a rule; this is the standard counterexample to believing it is.
The technique worth keeping
Count what each addition contributes rather than extrapolating the totals. A pattern that holds for the first few cases is a hypothesis, not a proof, and the ones that break late are the ones worth remembering.