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 designer draws n straight lines across a large sheet, no two parallel and no three through one…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A designer draws n straight lines across a large sheet, no two parallel and no three through one…

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 designer draws nnn straight lines across a large sheet, no two parallel and no three through one point. Some regions are closed (bounded) and the rest run off to infinity (unbounded).

  1. Prove by induction that the lines make R(n)=n2+n+22R(n) = \dfrac{n^2 + n + 2}{2}R(n)=2n2+n+2​ regions in all.
  1. Explain why exactly 2n2n2n of the regions are unbounded, for n≥1n \ge 1n≥1. Think of a very large circle that every crossing point lies inside: the lines cut it into arcs.
  1. Deduce a formula for the number of bounded regions, and simplify it.
  1. For 101010 lines, how many regions are there in all, and how many are bounded?

Check your formulas for n=3n = 3n=3 by drawing three lines that form a triangle.

Check your answer

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

Need a reminder? The key ideaShow

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. Base case of (a). With 000 lines there is 111 region, and 0+0+22=1\dfrac{0 + 0 + 2}{2} = 120+0+2​=1.

Step 2. The step. Assume kkk lines make R(k)R(k)R(k) regions. Line k+1k + 1k+1 crosses each of the kkk lines once, at kkk different points. These points cut it into k+1k + 1k+1 pieces, and each piece splits a region in two. So

R(k+1)=k2+k+22+k+1=(k+1)2+(k+1)+22.\displaystyle R(k + 1) = \dfrac{k^2 + k + 2}{2} + k + 1 = \dfrac{(k + 1)^2 + (k + 1) + 2}{2}.R(k+1)=2k2+k+2​+k+1=2(k+1)2+(k+1)+2​.

By induction the formula holds for every n≥0n \ge 0n≥0.

Step 3. Part (b). Take a circle so large that every crossing point is inside it. Each line meets the circle in 222 points, so there are 2n2n2n points, which cut the circle into 2n2n2n arcs. Each unbounded region meets the circle in exactly one arc. So there are 2n2n2n unbounded regions.

Step 4. Part (c). Bounded regions: n2+n+22−2n=n2−3n+22=(n−1)(n−2)2\dfrac{n^2 + n + 2}{2} - 2n = \dfrac{n^2 - 3n + 2}{2} = \dfrac{(n - 1)(n - 2)}{2}2n2+n+2​−2n=2n2−3n+2​=2(n−1)(n−2)​.

Step 5. Part (d). For n=10n = 10n=10: R=100+10+22=56R = \dfrac{100 + 10 + 2}{2} = 56R=2100+10+2​=56, and bounded 9×82=36\dfrac{9 \times 8}{2} = 3629×8​=36.

Check. Three lines make 777 regions, 666 unbounded and 111 bounded, the triangle. The formulas give 777 and 111.

Answer: 565656 regions, of which 363636 are bounded.

Log in to save this for later
← All Problems
← An L-shaped piece covers three squares: two side by side and one more next to one of them…Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n… →
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. An L-shaped piece covers three squares: two side by side and one more next to one of them…Advanced
  3. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  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 →
Hide

Split the problem so that a smaller copy appears: four quarter boards, one line fewer, one disc fewer. Count what one more piece adds. If the step fails, prove a stronger statement or induct on a different quantity.