HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Some circles are drawn in a plane. Every two of them cross in exactly two points, and no three of…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryproofNumericalOlympiad

Some circles are drawn in a plane. Every two of them cross in exactly two points, and no three of…

StemPy LabContributed by StemPy Lab

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 222 regions, inside and outside. Two such circles make 444 regions.

Let rnr_nrn​ be the number of regions made by nnn such circles. Prove that rn=rn−1+2(n−1)r_n = r_{n-1} + 2(n - 1)rn​=rn−1​+2(n−1) for n≥2n \ge 2n≥2. Look at the arcs into which the old circles cut the new circle. Then solve the recurrence, and find the number of regions for 888 circles and the number of new regions made by the 888th circle.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Name the count ana_nan​. 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.

The worked solution

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 nnnth circle meets each old circle in 222 points, and no point is shared by three circles. So it carries 2(n−1)2(n - 1)2(n−1) different crossing points.

Step 2. Arcs. For n≥2n \ge 2n≥2, these points cut the new circle into 2(n−1)2(n - 1)2(n−1) arcs.

Step 3. New regions. Each arc runs through one old region and splits it into two. So the new circle adds 2(n−1)2(n - 1)2(n−1) regions, and rn=rn−1+2(n−1)r_n = r_{n-1} + 2(n - 1)rn​=rn−1​+2(n−1).

Step 4. Solve. rn=2+2(1+2+⋯+(n−1))=2+n(n−1)=n2−n+2r_n = 2 + 2(1 + 2 + \dots + (n - 1)) = 2 + n(n - 1) = n^2 - n + 2rn​=2+2(1+2+⋯+(n−1))=2+n(n−1)=n2−n+2.

Step 5. Eight circles. The 888th circle adds 2×7=142 \times 7 = 142×7=14 regions, and r8=64−8+2=58r_8 = 64 - 8 + 2 = 58r8​=64−8+2=58.

Check. r2=4r_2 = 4r2​=4 and r3=8r_3 = 8r3​=8, which match a drawing of two and three circles.

Answer: the 888th circle adds 141414 regions, and 888 circles make 585858 regions. Proof complete.

Log in to save this for later
← All Problems
← A garden path is a row of 14 paving slabs…A sensor sends signals as strings of the digits 0 and 1… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Setting up a recurrenceRecurrences and Counting by Recursion

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
Advanced
  • A river town has five land areas, A, B, C, D and E, joined by ten bridges…Hard
  • All problems on this topic →