A pizza in the shape of a regular
n
-gon is sliced in an unusual way:
How many ways can a 16-gon pizza be sliced?
Details and Assumptions
The pizza has non-uniform topping placement; rotated or flipped solutions are counted separately.
For example, a pentagon pizza can be sliced 5 ways, as depicted in the image.
The pieces don't necessarily need to be of equal area.
This is not an original problem.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes, this is right. Now it's bonus question time: in the problem, I stated this is not an original problem. Do you know which famous mathematician worked on this problem? (although they probably didn't have pizza on mind)
Log in to reply
You could have used the word 'triangulations' for this problem.
Number of ways a regular n-gon can be divided into n - 2 triangles if different orientations are counted separately is the Catalan number C n − 2 , where the Catalan numbers C n are defined as:
C n = n + 1 1 ( n 2 n ) = n ! ( n + 1 ) ! ( 2 n ) !
Thus the number of ways to divide a regular 16-gon into n - 2 triangles if different orientations are counted separately is:
C 1 6 − 2 = C 1 4 = 1 4 + 1 1 ( 1 4 2 ( 1 4 ) ) = 1 4 ! ( 1 4 + 1 ) ! ( 2 ( 1 4 ) ) ! = 2674440
Bonus: the mathematician who worked on this problem was Euler.
Problem Loading...
Note Loading...
Set Loading...
This is just Catalan number . Because we want to cut a non zero area of pizza, the number of ways is simply C 1 6 − 2 = C 1 4 = 1 4 + 1 1 ⋅ ( 1 4 2 ⋅ 1 4 ) = 2 6 7 4 4 4 0