TOPICS
Search

Catalan's Problem


The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n letters). For example, for the four factors a, b, c, and d, there are five possibilities: ((ab)c)d, (a(bc))d, (ab)(cd), a((bc)d), and a(b(cd)).

The solution was given by Catalan in 1838 as

C_n^'=((4n-6)!!!!)/(n!)
(1)
=(2·6·10...(4n-6))/(n!)
(2)
=C_(n-1),
(3)

where n!!!! is a multifactorial, n! is the usual factorial, and C_n is a so-called Catalan number.


See also

Binary Bracketing, Catalan's Diophantine Problem, Catalan Number, Euler's Polygon Division Problem

Explore with Wolfram|Alpha

References

Dörrie, H. 100 Great Problems of Elementary Mathematics: Their History and Solutions. New York: Dover, p. 23, 1965.

Referenced on Wolfram|Alpha

Catalan's Problem

Cite this as:

Weisstein, Eric W. "Catalan's Problem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CatalansProblem.html

Subject classifications