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. /Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…

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.

Read this false proof carefully.

Claim. For every n≥2n \ge 2n≥2: if nnn lines in the plane are such that no two are parallel, then all nnn lines pass through one point.

Proof. For n=2n = 2n=2, two lines that are not parallel meet in a point. Assume the claim for kkk lines, and take k+1k + 1k+1 lines L1,…,Lk+1L_1, \dots, L_{k + 1}L1​,…,Lk+1​, no two parallel. By the hypothesis, L1,…,LkL_1, \dots, L_kL1​,…,Lk​ pass through one point PPP, and L2,…,Lk+1L_2, \dots, L_{k + 1}L2​,…,Lk+1​ pass through one point QQQ. The lines L2,…,LkL_2, \dots, L_kL2​,…,Lk​ pass through both PPP and QQQ, so P=QP = QP=Q, and all k+1k + 1k+1 lines pass through it.

  1. Show that the claim is false for n=3n = 3n=3 by giving three lines.
  1. Find the value of kkk at which the step fails, and explain the failure.
  1. How many lines do the two groups share at that value of kkk?
  1. For which kkk does the step work, and why does that not save the proof?

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). The lines y=0y = 0y=0, x=0x = 0x=0 and y=x+1y = x + 1y=x+1 are not parallel in pairs. The first two meet at (0,0)(0, 0)(0,0), which is not on y=x+1y = x + 1y=x+1. So the three lines do not share a point.

Step 2. Part (b). The argument "L2,…,LkL_2, \dots, L_kL2​,…,Lk​ pass through both PPP and QQQ, so P=QP = QP=Q" needs at least two shared lines, since two different lines meet in exactly one point. For k=2k = 2k=2 the shared group is L2L_2L2​ alone. One line passes through many points, so PPP and QQQ can be different. The step fails at k=2k = 2k=2, that is from 222 lines to 333.

Step 3. Part (c). At k=2k = 2k=2 the groups {L1,L2}\{L_1, L_2\}{L1​,L2​} and {L2,L3}\{L_2, L_3\}{L2​,L3​} share 111 line.

Step 4. Part (d). For k≥3k \ge 3k≥3 the groups share at least two lines, so P=QP = QP=Q and the step is valid. But the chain needs every link. With the link from 222 to 333 broken, the true case n=2n = 2n=2 never reaches n=3n = 3n=3, and nothing beyond it is proved.

Watch out. This is the same error as in the proof that all horses have one colour.

Answer: the step fails at k=2k = 2k=2, where the two groups share only 111 line.

Log in to save this for later
← All Problems
← A student claims that, for every whole number n ≥ 1, 1 + 2 + 3 + … + n = ((2n + 1)²)/8.…A student puts n points on a circle and joins every pair by a straight chord, choosing the points… →
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. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  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.