Cake number

In mathematics, the cake number, denoted by C_n, is the maximum 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.

Animation showing the cutting planes required to cut a cake into 15 pieces with 4 slices (representing the 5th cake number). Fourteen of the pieces would have an external surface, with one tetrahedron cut out of the middle.

The values of C_n for increasing n ≥ 0 are given by 1, 2, 4, 8, 15, 26, 42, 64, 93, …(sequence A000125 in the OEIS)

General formula

If n! denotes the factorial, and we denote the binomial coefficients 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:[1]

C_{n}={n \choose 3}+{n \choose 2}+{n \choose 1}+{n \choose 0}={\tfrac {1}{6}}\left(n^{3}+5n+6\right).

Properties

The only cake number which is prime is 2.

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.[1]

References

Yaglom, A. M.; Yaglom, I. M. (1987). Challenging Mathematical Problems with Elementary Solutions. 1. New York: Dover Publications.

External links

Eric Weisstein. "Space Division by Planes". MathWorld. Retrieved January 14, 2021.
Eric Weisstein. "Cake Number". MathWorld. Retrieved January 14, 2021.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[Yaglom-Yaglom-1] Yaglom, A. M.; Yaglom, I. M. (1987). Challenging Mathematical Problems with Elementary Solutions. 1. New York: Dover Publications.