Cake number

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

cut out of the middle. In mathematics, the cake number, denoted by C n , is the maximum of the number of regions into which a 3-dimensional cube can be partitioned by exactly n planes. The cake number is so called because one may imagine each partition of the cube by a plane as a slice made by a knife through a cube-shaped cake. It is the 3D analogue of the lazy caterer's sequence. The values of C n for are given by .

cut out of the middle.]] In mathematics, the cake number, denoted by C n , is the maximum of the number of regions into which a 3-dimensional cube can be partitioned by exactly n planes. The cake number is so called because one may imagine each partition of the cube by a plane as a slice made by a knife through a cube-shaped cake. It is the 3D analogue of the lazy caterer's sequence. The values of C n for are given by . {n \choose k} = \frac{n!}{k!(n-k)!}, and we assume that n planes are available to partition the cube, then the n-th cake number is: C_n = {n \choose 3} + {n \choose 2} + {n \choose 1} + {n \choose 0} = \tfrac{1}{6}\!\left(n^3 + 5n + 6\right) = \tfrac{1}{6}(n+1)\left(n(n-1) + 6\right).

Properties

The cake numbers are the 3-dimensional analogue of the 2-dimensional lazy caterer's sequence. The difference between successive cake numbers also gives the lazy caterer's sequence. The fourth column of Bernoulli's triangle (k = 3) gives the cake numbers for n cuts, where n ≥ 3. that summing up to the first 4 terms on each row of Pascal's triangle is equivalent to summing up to the first 2 even terms of the next row]] The sequence can be alternatively derived from the sum of up to the first 4 terms of each row of Pascal's triangle:

External links

Text derived from https://en.wikipedia.org/w/index.php?oldid=1372144469 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.