# Maximum number of pieces of equal area you can obtain by cutting a pizza a certain number of times

If I cut a perfectly circular pizza through its center 6 times at 30° angles, I get 12 pieces of equal area.

If I don't have to cut through the center, I can cut in a grid shape to divide the pizza into 16 pieces, but only the middle four will be of equal area.

Theoretically I could cut the pizza into a total of 22 pieces using 6 cuts, but more often than not none of them would be of equal area.

For 6 cuts, what is the largest number of pieces of equal size I can obtain (using only straight cuts that go through the entire pizza)? What about $n$ cuts?

And since people are posting answers to this effect, no, you are not allowed to fold the pizza or rearrange slices. This is not a lateral thinking puzzle.

• And we are only talking about straight line cuts? – skv Nov 7 '14 at 3:09
• May one obtain extra pieces that are a different area but don't count? Or does every piece obtained have to have the same area? – xnor Nov 7 '14 at 6:41
• You can have extra pieces that don't count, yes. – Joe Z. Nov 7 '14 at 6:42
• I think I can get 16 for n=6, but it's hard to prove or draw. It use an intermediate value theorem argument to show that three shapes can be made to have equal areas by tuning two parameters. – xnor Nov 7 '14 at 9:45
• Your comment about left-over pieces being allowed should really be in the question body, not just a comment. Most similar puzzles I have seen do not allow left over pieces. – DeveloperInDevelopment Nov 8 '14 at 7:23

If you can fold the pizza, with one cut you could ideally create infinite slices. Just fold the pizza N times along the symmetry axis and cut it in the middle.

What you obtain is 2(N-1) triangular slices folded in half, and ready for eating.

5 folds, 1 cut (I know what you're thinking, dirty mind): • In my mind it works (I got for induction up to 3 folds), I need to try with a piece of paper though :) – clabacchio Nov 7 '14 at 12:53
• yes please experiment with the paper up to at least 8 folds. – Kenshin Nov 7 '14 at 13:06
• @Mew I see what you did there ;/ – clabacchio Nov 7 '14 at 13:08
• "'if' you can fold the pizza" I've updated the question statement to clarify that you can't. – Joe Z. Nov 7 '14 at 16:50

I can only create 64 slices.

Step 1. Cut the pizza from North to South (2 slices)

Step 2. Cut the pizza from East to West (4 slicles)

Step 3. Lay the 4 slices on top of each other pointing East and cut from East to West (8 slices)

Step 4. Lay the 8 slices again on top of each other and slice (16 slices)

Step 5. Repeat 32 slices

Step 6. Repeat again 64 slices

The maximum number of slices is thus given by 2^n, where n is the number of cuts.

• Since maximum possible number of slices is given as; $$\frac{n*(n+1)}{2}+1=22$$ which can be obtained by intersection of 6 lines, putting slices on top of each other is invalid. – shyos Nov 7 '14 at 11:43
• @shyos, clearly your formula doesn't take into account my method of stacking pizza slices on top of one another before cutting. Where in the question does it state it is invalid? – Kenshin Nov 7 '14 at 11:44
• as OP states,"Theoretically I could cut the pizza into a total of 22 pieces using 6 cuts, but more often than not none of them would be of equal area." – shyos Nov 7 '14 at 11:50
• @shyos, he's talking theoretically, but practically you can cut it into 64 equal slices. – Kenshin Nov 7 '14 at 11:52
• He uses 'theoretically', since it is the maximum possible slices for n=6. But those slices wont have equal area. So slice number should be less than < 22 – shyos Nov 7 '14 at 11:55

With a pizza, I guess the answer is logically 12, like you said. A taller cylinder is a different scenario, as you could cut through the middle height-wise, but this is not viable with a pizza. You could technically cut a cylinder into n discs of equal size.

• We're assuming that the pizza is flat, not a cylinder. – Joe Z. Nov 7 '14 at 6:57
• Also, I know of a way to get 17 pieces for 8 cuts. The answer isn't always $2n$. – Joe Z. Nov 7 '14 at 6:58

Cut two equilateral triangles? This should give you both the same size pieces on the outside, as well as same size pieces on the inside. • That's two groups of 6 pieces, though, which only counts as 6 because you can only consider one group at a time. – Joe Z. Nov 7 '14 at 5:17

I'm aware of an algorithm for $(\frac{n}{2}-2)^2 + 8$ pieces given $n \ge 6$ cuts as follows:

Inscribe a square $S$ inside the circle. Let $d$ be some distance from the edge of the square, and cut $\frac{n}{2}$ times, equally spaced between $d$ away from one edge to $d$ away from the opposite edge, both horizontally and vertically (for a total of $n$ cuts).

By the Intermediate Value Theorem, there exists some value $d$ for which the 8 edge pieces adjacent to the corners and the inside pieces all have equal area, which is a total of $(\frac{n}{2}-2)^2 + 8$ pieces.

This overtakes the naive solution of $2n$ after $n = 8$. It gives $17$ pieces for $8$ cuts, $24$ pieces for $10$ cuts, $35$ pieces for $12$ cuts, etc.

There may be a solution better than this one, though. Anyone else willing to give it a shot?