Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A student puts points on a circle and joins every pair by a straight chord, choosing the points so that no three chords meet at one point inside. She counts the regions inside the circle: for . She claims that points always give regions.
You may use the fact that every four of the points give exactly one crossing of two chords inside the circle.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Part (a). Draw the chords one at a time. A chord that crosses chords already drawn is cut into pieces, and each piece splits one region in two. So the chord adds regions. Adding over all chords: we gain for each chord and for each crossing. There are chords, and each set of four points gives one crossing, so crossings. With the first region, the total is .
Step 2. Part (b). For points: . For points: .
Step 3. Part (c). The formula equals for , and then falls behind: , . So the claim holds only for .
Step 4. Part (d). A pattern that fits the first few cases can still be wrong. A claim about every needs a proof, and here the proof gives a different formula.
Answer: regions for points and for points.
Log in to join the discussion.
Loading…
A valid induction needs a true base case. The step must work for every from the base case on, the smallest too. A step that looks back further needs more base cases. The step ends at and never starts from it.