|
|
| Line 1: |
Line 1: |
| [[Image:PancakeCutThrice.agr.jpg|thumb|Pancake cut into seven pieces with three straight cuts.]]
| | 39 yr old Supply and Distribution Manager Truman from Regina, has pastimes such as metal detection, property developers in singapore and cigar smoking. Remembers what an amazing location it was having traveled to St Augustine's Abbey.<br><br>Also visit my web page - [http://www.mremotorsport.co.uk/?option=com_k2&view=itemlist&task=user&id=50166 www.mremotorsport.co.uk] |
| The '''lazy caterer's sequence,''' more formally known as the '''central polygonal numbers''', describes the maximum number of pieces of a [[circle]] (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, but 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 3 dimensions is the [[cake number]].
| |
| | |
| ==Formula and sequence==
| |
| The maximum number ''p'' of pieces that can be created with a given number of cuts ''n'', where ''n'' ≥ 0, is given by the formula
| |
| | |
| :<math> p = \frac{n^2+n+2}{2}.</math>
| |
| | |
| Using [[binomial coefficient]]s, the formula can be expressed as
| |
| | |
| :<math>p = {\tbinom {n + 1} 2} + 1 = {\tbinom n 2}+{\tbinom n 1}+{\tbinom n 0}. </math>
| |
| | |
| This [[sequence]] {{OEIS|id=A000124}}, starting with <math>n=0</math>, results in
| |
| | |
| :[[1 (number)|1]], [[2 (number)|2]], [[4 (number)|4]], [[7 (number)|7]], [[11 (number)|11]], [[16 (number)|16]], [[22 (number)|22]], [[29 (number)|29]], [[37 (number)|37]], [[46 (number)|46]], [[56 (number)|56]], [[67 (number)|67]], [[79 (number)|79]], [[92 (number)|92]], [[106 (number)|106]], [[121 (number)|121]], [[137 (number)|137]], [[154 (number)|154]], [[172 (number)|172]], [[191 (number)|191]], [[211 (number)|211]], ...
| |
| | |
| Each number equals 1 plus a [[triangular number]].
| |
| | |
| ==Proof==
| |
| [[Image:Hjintersecting.svg|thumb|Two cuts produce four pieces.]]
| |
| When a circle is cut ''n'' times to produce the maximum number of pieces, represented as ''p'' = ''ƒ''(''n''), the ''n''th cut must be considered; the number of pieces before the last cut is ''ƒ''(''n'' − 1), while the number of pieces added by the last cut is ''n''.
| |
| | |
| To obtain the maximum number of pieces, the ''n''th cut line should cross all the other previous cut lines inside the circle, but not cross any intersection of previous cut lines. Thus, the ''n''th line itself is cut in ''n'' − 1 places, and into ''n'' line segments. Each segment divides one piece of the (''n'' − 1)-cut pancake into 2 parts, adding exactly ''n'' to the number of pieces. The new line can't have any more segments since it can only cross each previous line once. A cut line can always cross over all previous cut lines, as rotating the knife at a small angle around a point that is not an existing intersection will, if the angle is small enough, intersect all the previous lines including the last one added.
| |
| | |
| Thus, the total number of pieces after ''n'' cuts is
| |
| | |
| :<math>f(n)=n+f(n-1).\,</math>
| |
| | |
| This [[recurrence relation]] can be solved. If ''ƒ''(''n'' − 1) is expanded one term the relation becomes
| |
| | |
| :<math>f(n)=n+(n-1)+f(n-2).\,</math>
| |
| | |
| Expansion of the term ''ƒ''(''n'' − 2) can continue until the last term is reduced to ''ƒ''(0), thus,
| |
| | |
| :<math>f(n)=n+(n-1)+(n-2)+\cdots+1+f(0).\,</math>
| |
| | |
| Since <math>f(0)=1</math>, because there is one piece before any cuts are made, this can be rewritten as
| |
| | |
| :<math>f(n)=1+(1+2+3+\cdots+n).\,</math> | |
| | |
| This can be simplified, using the formula for the sum of an [[arithmetic progression]]:
| |
| | |
| :<math>f(n)=1+\frac{n(n+1)}{2}=\frac{n^2+n+2}{2}.</math>
| |
| | |
| ==References==
| |
| *{{citation
| |
| | last = Moore | first = T. L.
| |
| | issue = 2
| |
| | journal = The College Mathematics Journal
| |
| | pages = 125–130
| |
| | title = Using Euler's formula to solve plane separation problems
| |
| | jstor = 2686448
| |
| | volume = 22
| |
| | year = 1991
| |
| | doi = 10.2307/2686448
| |
| | publisher = Mathematical Association of America}}.
| |
| | |
| *{{citation
| |
| | last = Steiner | first = J. | author-link = Jakob Steiner
| |
| | journal = [[Crelle's Journal|J. Reine Angew. Math.]]
| |
| | pages = 349–364
| |
| | title = Einige Gesetze über die Theilung der Ebene und des Raumes ("A Few Statements about the Division of the Plane and of Space")
| |
| | volume = 1
| |
| | year = 1826}}.
| |
| | |
| *{{citation
| |
| | last = Wetzel | first = J. E.
| |
| | issue = 8
| |
| | journal = American Mathematical Monthly
| |
| | pages = 647–656
| |
| | title = On the division of the plane by lines
| |
| | url = http://webcourse.cs.technion.ac.il/236603/Spring2008/ho/WCFiles/Wetzel.pdf
| |
| | volume = 85
| |
| | year = 1978
| |
| | doi = 10.2307/2320333
| |
| | publisher = Mathematical Association of America
| |
| | jstor = 2320333}}.
| |
| | |
| ==External links==
| |
| *{{mathworld|title=Circle Division by Lines|urlname=CircleDivisionbyLines}}
| |
| | |
| [[Category:Mathematical optimization]]
| |
| [[Category:Integer sequences]]
| |
| [[Category:Articles containing proofs]]
| |
39 yr old Supply and Distribution Manager Truman from Regina, has pastimes such as metal detection, property developers in singapore and cigar smoking. Remembers what an amazing location it was having traveled to St Augustine's Abbey.
Also visit my web page - www.mremotorsport.co.uk