Catalan's Problem
The problem of finding the number of different ways in which a Product of 
different ordered Factors canbe calculated by pairs (i.e., the number of Binary Bracketings of letters). For example, forthe four Factors 
, 
, 
, and 
, there are five possibilities: 
, 
, 
,
, and 
. The solution was given by Catalan in 1838 as
and is equal to the Catalan Number
.See also Binary Bracketing, Catalan's Diophantine Problem, Euler's Polygon Division Problem
References
Dörrie, H. 100 Great Problems of Elementary Mathematics: Their History and Solutions. New York: Dover, p. 23, 1965.
- Small Number
- Small Retrosnub Icosicosidodecahedron
- Small Rhombicosidodecahedron
- Small Rhombicuboctahedron
- Small Rhombidodecacron
- Small Rhombidodecahedron
- Small Rhombihexacron
- Small Rhombihexahedron
- Small Snub Icosicosidodecahedron
- Small Stellapentakis Dodecahedron
- Small Stellated Dodecahedron
- Small Stellated Triacontahedron
- Small Stellated Truncated Dodecahedron
- Small Triakis Octahedron
- Small Triambic Icosahedron
- Small World Problem
- Smarandache Ceil Function
- Smarandache Constants
- Smarandache Function
- Smarandache-Kurepa Function
- Smarandache Near-to-Primorial Function
- Smarandache Paradox
- Smarandache Sequences
- Smarandache-Wagstaff Function
- Smith Brothers