|
maths
|
|
|
|
|
Bookmarks
|
|
|
|
|
|
|
|
|
|
Save Link
Create/Add to List
|
|
|
|
|
|
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into n-2 triangles if different orientations are counted separately?" (Euler's polygon division problem).
http://mathworld.wolfram.com/CatalanNumber.html
created by maths on 2008-06-05 06:55:39
|
|
Re-interpreting the symbol X as an open parenthesis and Y as a close parenthesis, Cn counts the number of expressions containing n pairs of parentheses which are correctly matched:
http://en.wikipedia.org/wiki/Catalan_number
created by maths on 2008-06-05 06:54:53
|
|
|