Search results
Results From The WOW.Com Content Network
Example of application of the theorem with eight sectors: by cutting the pizza along the blue lines and, alternately taking one slice each, proceeding clockwise or counterclockwise, two diners eat the same amount (measured in area) of pizza. Proof without words for 8 sectors by Carter & Wagon (1994a).
An application of the theorem is seen when a flat object is somewhat folded or bent along a line, creating rigidity in the perpendicular direction. This is of practical use in construction, as well as in a common pizza-eating strategy: A flat slice of pizza can be seen as a surface with constant Gaussian curvature 0. Gently bending a slice must ...
Pitot theorem (plane geometry) Pizza theorem ; Pivot theorem ; Planar separator theorem (graph theory) Plancherel theorem (Fourier analysis) Plancherel theorem for spherical functions (representation theory) Poincaré–Bendixson theorem (dynamical systems) Poincaré–Birkhoff–Witt theorem (universal enveloping algebras)
The maximum number of pieces from consecutive cuts are the numbers in the Lazy Caterer's Sequence. When a circle is cut n times to produce the maximum number of pieces, represented as p = f (n), the n th cut must be considered; the number of pieces before the last cut is f (n − 1), while the number of pieces added by the last cut is n.
Proof without words of the Nicomachus theorem (Gulley (2010)) that the sum of the first n cubes is the square of the n th triangular number. In mathematics, a proof without words (or visual proof) is an illustration of an identity or mathematical statement which can be demonstrated as self-evident by a diagram without any accompanying explanatory text.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate; Pages for logged out editors learn more
For an example, see the file Pizza theorem1.svg: . Licensing This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication .
The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.