AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
Personal tools

Catalan sequence

From AoPSWiki

(Redirected from Catalan Numbers)

The Catalan sequence is a sequence of positive integers that arise as the solution to a wide variety of combinatorial problems. The first few terms of the Catalan sequence are C_0 = 1, C_1 = 1, C_2 = 2, C_3 = 5, .... In general, the nth term of the Catalan sequence is given by the formula C_n = \frac{1}{n + 1}\binom{2n}{n}, where \binom{2n}{n} is the nth central binomial coefficient.

Contents

Introduction

The Catalan sequence can be used to find:

  1. The number of ways to arrange n pairs of matching parentheses.
  2. The number of ways a convex polygon of n+2 sides can be split into n triangles by n - 1 nonintersection diagonals.
  3. The number of rooted binary trees with exactly n+1 leaves.

Example

In how many ways can the product of n ordered number be calculated by pairs? For example, the possible ways for a\cdot b\cdot c\cdot d are a((bc)d), a(b(cd)), (ab)(cd), ((ab)c)d, and (a(bc))d.

Solution

See Also

External Links

Trying to make National MATHCOUNTS next year? Our Advanced MATHCOUNTS/AMC 8 course can help you prepare. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us