.gif)
Lazy caterer's sequence
The lazy caterer's sequence, more formally known as the central polygonal numbers, describes the maximum number of pieces of a disk (a pancake or pizza is usually used to describe the situation) that can be made with a given number of straight cuts. For example, three cuts across a pancake will produce six pieces if the cuts all meet at a common point inside the circle, but up to seven if they do not. This problem can be formalized mathematically as one of counting the cells in an arrangement of lines; for generalizations to higher dimensions, see arrangement of hyperplanes.
- Comment
- enThe lazy caterer's sequence, more formally known as the central polygonal numbers, describes the maximum number of pieces of a disk (a pancake or pizza is usually used to describe the situation) that can be made with a given number of straight cuts. For example, three cuts across a pancake will produce six pieces if the cuts all meet at a common point inside the circle, but up to seven if they do not. This problem can be formalized mathematically as one of counting the cells in an arrangement of lines; for generalizations to higher dimensions, see arrangement of hyperplanes.
- Depiction
- Has abstract
- enThe lazy caterer's sequence, more formally known as the central polygonal numbers, describes the maximum number of pieces of a disk (a pancake or pizza is usually used to describe the situation) that can be made with a given number of straight cuts. For example, three cuts across a pancake will produce six pieces if the cuts all meet at a common point inside the circle, but up to seven if they do not. This problem can be formalized mathematically as one of counting the cells in an arrangement of lines; for generalizations to higher dimensions, see arrangement of hyperplanes. The analogue of this sequence in three dimensions is the cake number.
- Is primary topic of
- Lazy caterer's sequence
- Label
- enLazy caterer's sequence
- Link from a Wikipage to an external page
- webcourse.cs.technion.ac.il/236603/Spring2008/ho/WCFiles/Wetzel.pdf
- web.archive.org/web/20110721134954/http:/webcourse.cs.technion.ac.il/236603/Spring2008/ho/WCFiles/Wetzel.pdf
- Link from a Wikipage to another Wikipage
- 1 (number)
- 106 (number)
- 11 (number)
- 121 (number)
- 137 (number)
- 154 (number)
- 16 (number)
- 172 (number)
- 191 (number)
- 2 (number)
- 211 (number)
- 22 (number)
- 29 (number)
- 37 (number)
- 4 (number)
- 46 (number)
- 56 (number)
- 67 (number)
- 7 (number)
- 79 (number)
- 92 (number)
- Arithmetic progression
- Arrangement of hyperplanes
- Arrangement of lines
- Bernoulli's triangle
- Binomial coefficient
- Cake number
- Category:Articles containing proofs
- Category:Integer sequences
- Category:Mathematical optimization
- Crelle's Journal
- Disk (mathematics)
- Dividing a circle into areas
- File:Lazy Caterer's Sequence (Cuts).gif
- File:PancakeCutThrice.agr.jpg
- Floyd's triangle
- Pancake
- Pascal's triangle
- Pizza
- Recurrence relation
- Sequence
- Triangular number
- SameAs
- 28Rj2
- Lazy caterer's sequence
- m.06gwdf
- Numero poligonale centrale
- Q2259070
- Suite du traiteur paresseux
- Teorema del cortador perezoso
- Zentralpolygonale Zahlen
- Центральные многоугольные числа
- Центральні багатокутні числа
- 怠け仕出し屋の数列
- Subject
- Category:Articles containing proofs
- Category:Integer sequences
- Category:Mathematical optimization
- Thumbnail
- Title
- enCircle Division by Lines
- Urlname
- enCircleDivisionbyLines
- WasDerivedFrom
- Lazy caterer's sequence?oldid=1123903682&ns=0
- WikiPageLength
- 7054
- Wikipage page ID
- 2038304
- Wikipage revision ID
- 1123903682
- WikiPageUsesTemplate
- Template:=
- Template:Bernoulli triangle columns.svg
- Template:Central polygonal numbers.svg
- Template:Citation
- Template:Diagonal split header
- Template:Figure space
- Template:Math
- Template:Mathworld
- Template:OEIS
- Template:Reflist
