Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Some circles are drawn in a plane. Every two of them cross in exactly two points, and no three of them pass through one point. One circle cuts the plane into regions, inside and outside. Two such circles make regions.
Let be the number of regions made by such circles. Prove that for . Look at the arcs into which the old circles cut the new circle. Then solve the recurrence, and find the number of regions for circles and the number of new regions made by the th circle.
Name the count . Split on the first or the last step so that each case is a smaller copy of the same question. Check that the cases do not overlap and cover everything, then find the starting values by hand.
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.
Plan. Count the arcs on the new circle. Then unroll the recurrence.
Step 1. Crossing points. The th circle meets each old circle in points, and no point is shared by three circles. So it carries different crossing points.
Step 2. Arcs. For , these points cut the new circle into arcs.
Step 3. New regions. Each arc runs through one old region and splits it into two. So the new circle adds regions, and .
Step 4. Solve. .
Step 5. Eight circles. The th circle adds regions, and .
Check. and , which match a drawing of two and three circles.
Answer: the th circle adds regions, and circles make regions. Proof complete.
Log in to join the discussion.
Loading…