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. /A convex polygon with 9 sides is to be cut into triangles by drawing diagonals that do not cross…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalOlympiad

A convex polygon with 9 sides is to be cut into triangles by drawing diagonals that do not cross…

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 convex polygon with 999 sides is to be cut into triangles by drawing diagonals that do not cross inside it. A second question looks different. On a grid, a path goes from the corner (0,0)(0, 0)(0,0) to the corner (5,5)(5, 5)(5,5) in unit steps to the right or up. It may touch the diagonal y=xy = xy=x but never go above it.

Both questions are counted by Catalan numbers. Say which Catalan number answers each one and find both counts. Use Cn=1n+1(2nn)C_n = \dfrac{1}{n + 1}\dbinom{2n}{n}Cn​=n+11​(n2n​), and explain why a polygon with n+2n + 2n+2 sides goes with CnC_nCn​.

Check your answer

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

Need a reminder? The key ideaShowHide

Dn=(n−1)(Dn−1+Dn−2)D_n = (n - 1)(D_{n-1} + D_{n-2})Dn​=(n−1)(Dn−1​+Dn−2​) with D1=0D_1 = 0D1​=0 and D2=1D_2 = 1D2​=1, and DnD_nDn​ is the whole number nearest to n!e\dfrac{n!}{e}en!​. The Catalan numbers are Cn=1n+1(2nn)C_n = \dfrac{1}{n + 1}\dbinom{2n}{n}Cn​=n+11​(n2n​).

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. Why n+2n + 2n+2 sides give CnC_nCn​. Fix one side of the polygon. In any triangulation it lies in one triangle, whose third corner splits the rest into two smaller polygons. This gives the Catalan recurrence Tn+1=∑TiTn−iT_{n+1} = \sum T_iT_{n-i}Tn+1​=∑Ti​Tn−i​, where TnT_nTn​ counts the triangulations of a polygon with n+2n + 2n+2 sides and T0=1T_0 = 1T0​=1 for a single side.

Step 2. The polygon. 9=7+29 = 7 + 29=7+2, so the count is C7=18(147)=34328=429C_7 = \dfrac{1}{8}\dbinom{14}{7} = \dfrac{3432}{8} = 429C7​=81​(714​)=83432​=429.

Step 3. The paths. The paths to (5,5)(5, 5)(5,5) are C5=16(105)=2526=42C_5 = \dfrac{1}{6}\dbinom{10}{5} = \dfrac{252}{6} = 42C5​=61​(510​)=6252​=42.

Check. A pentagon has C3=5C_3 = 5C3​=5 triangulations, which a quick drawing confirms.

Answer: 429429429 triangulations and 424242 paths.

Log in to save this for later
← All Problems
← Six friends each bring a wrapped gift with their name on it…At a meeting each delegate shakes hands with some of the others, never twice with the same person… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Derangements and Catalan numbersRecurrences 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 →