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
  • 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. /A student puts n points on a circle and joins every pair by a straight chord, choosing the points…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A student puts n points on a circle and joins every pair by a straight chord, choosing the points…

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.

A student puts nnn 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: 1,2,4,8,161, 2, 4, 8, 161,2,4,8,16 for n=1,2,3,4,5n = 1, 2, 3, 4, 5n=1,2,3,4,5. She claims that nnn points always give 2n−12^{n - 1}2n−1 regions.

  1. Explain why the number of regions is 1+(n2)+(n4)1 + \dbinom{n}{2} + \dbinom{n}{4}1+(2n​)+(4n​). Start from one region, and count what each chord and each crossing adds.
  1. Find the number of regions for 666 points and for 777 points.
  1. For which nnn is her claim correct?
  1. In two sentences, say what this example teaches about guessing from small cases.

You may use the fact that every four of the points give exactly one crossing of two chords inside the circle.

Check your answer

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

Need a reminder? The key idea

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.

Step 1. Part (a). Draw the chords one at a time. A chord that crosses ccc chords already drawn is cut into c+1c + 1c+1 pieces, and each piece splits one region in two. So the chord adds 1+c1 + c1+c regions. Adding over all chords: we gain 111 for each chord and 111 for each crossing. There are (n2)\dbinom{n}{2}(2n​) chords, and each set of four points gives one crossing, so (n4)\dbinom{n}{4}(4n​) crossings. With the first region, the total is 1+(n2)+(n4)1 + \dbinom{n}{2} + \dbinom{n}{4}1+(2n​)+(4n​).

Step 2. Part (b). For 666 points: 1+15+15=311 + 15 + 15 = 311+15+15=31. For 777 points: 1+21+35=571 + 21 + 35 = 571+21+35=57.

Step 3. Part (c). The formula equals 2n−12^{n - 1}2n−1 for n=1,2,3,4,5n = 1, 2, 3, 4, 5n=1,2,3,4,5, and then falls behind: 31<3231 < 3231<32, 57<6457 < 6457<64. So the claim holds only for n≤5n \le 5n≤5.

Step 4. Part (d). A pattern that fits the first few cases can still be wrong. A claim about every nnn needs a proof, and here the proof gives a different formula.

Answer: 313131 regions for 666 points and 575757 for 777 points.

Log in to save this for later
← All Problems
← Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…An L-shaped piece covers three squares: two side by side and one more next to one of them… →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n…Advanced
  2. A designer draws n straight lines across a large sheet, no two parallel and no three through one…Advanced
  3. An L-shaped piece covers three squares: two side by side and one more next to one of them…Advanced
  4. Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…Advanced
  5. A student claims that, for every whole number n ≥ 1, 1 + 2 + 3 + … + n = ((2n + 1)²)/8.…Hard
All problems on this topic →
Show
Hide

A valid induction needs a true base case. The step must work for every kkk from the base case on, the smallest kkk too. A step that looks back further needs more base cases. The step ends at P(k+1)P(k + 1)P(k+1) and never starts from it.