I think it's Spanish?

A pizza in the shape of a regular n n -gon is sliced in an unusual way:

  1. Each cut is a straight line segment
  2. No cuts intersect inside the pizza
  3. Cuts are only made from one vertex to a non-adjacent vertex
  4. Only n 3 n - 3 cuts are made

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.


The answer is 2674440.

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.

2 solutions

Pi Han Goh
Mar 10, 2015

This is just Catalan number . Because we want to cut a non zero area of pizza, the number of ways is simply C 16 2 = C 14 = 1 14 + 1 ( 2 14 14 ) = 2674440 C_{16-2} = C_{14} = \frac {1}{14+1} \cdot { 2 \cdot 14 \choose 14 } = \boxed{2674440}

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)

Caleb Townsend - 6 years, 3 months ago

Log in to reply

You could have used the word 'triangulations' for this problem.

Nihar Mahajan - 6 years, 3 months ago
Frank Aiello
Aug 29, 2017

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 C_{n-2} , where the Catalan numbers C n C_n are defined as:

C n C_n = 1 n + 1 \frac{1}{n+1} ( 2 n n ) {{2n}\choose{n}} = ( 2 n ) ! n ! ( n + 1 ) ! \frac{(2n)!}{n!(n+1)!}

Thus the number of ways to divide a regular 16-gon into n - 2 triangles if different orientations are counted separately is:

C 16 2 C_{16 - 2} = C 14 C_{14} = 1 14 + 1 \frac{1}{14+1} ( 2 ( 14 ) 14 ) {{2(14)}\choose{14}} = ( 2 ( 14 ) ) ! 14 ! ( 14 + 1 ) ! \frac{(2(14))!}{14!(14+1)!} = 2674440

Bonus: the mathematician who worked on this problem was Euler.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...