Catalan Numbers
Count balanced parentheses, trees and paths.
Key idea
Count balanced parentheses, trees and paths.
In depth
Cₙ = C(2n, n)/(n + 1): 1, 1, 2, 5, 14, 42, ... They count balanced bracket strings, binary trees, paths staying below a diagonal, and polygon triangulations, all related by the recurrence Cₙ₊₁ = ΣCᵢCₙ₋ᵢ.
Worked example
C₃ = 5: the balanced strings ((())), (()()), (())(), ()(()), ()()().
Formula
Real-world uses
- Counting valid bracket patterns in code, binary tree shapes and checkout queue paths
Common mistake
Forgetting that indices start at 0 (C₀ = 1).
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Catalan Numbers?
Count balanced parentheses, trees and paths. It is a topic at the expert level in Discrete Math & Number Theory.
What is the formula for Catalan Numbers?
The key formula is Cₙ = C(2n,n)/(n+1).
Where is Catalan Numbers used in real life?
Real-world examples: Counting valid bracket patterns in code, binary tree shapes and checkout queue paths.
What should I learn before Catalan Numbers?
Make sure you are comfortable with Derangements, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Catalan Numbers?
Forgetting that indices start at 0 (C₀ = 1).
How can I practise Catalan Numbers?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Catalan Numbers?
Move on to Stirling Numbers next.
Related expert topics in Discrete Math & Number Theory
- Strong Induction – Assume all earlier cases to prove the next.
- Well-Ordering Principle – Every nonempty set of positive integers has a least element.
- Partial Orders – Reflexive, antisymmetric, transitive relations.
- Cardinality of Sets – Comparing sizes of infinite sets.
- Countable and Uncountable Sets – ℕ and ℚ are countable; ℝ is not.
- Cantor’s Diagonal Argument – Proof that real numbers are uncountable.