Catalan sequence

Revision as of 18:26, 31 August 2006 by Lemondemon (talk | contribs)

The Catalan Numbers are a sequence of numbers that show up in a variety of instances.

Introduction

Catalan numbers 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
  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