If Natalie cuts a round pizza with $4$ straight cuts, what is the maximum number of pieces that she can get? Note: Assume that all the cuts are vertical (perpendicular to the surface of the pizza). She cannot move the pizza pieces until she finishes cutting.
Problem
Source:
Tags: combinatorics
franzliszt
19.09.2020 02:38
Isn't this like really well known? $1 + \frac{n(n+1)}2$ and the answer is $11$.
Bowser498
19.09.2020 02:46
16
? Oh, when the problem said "she cannot move the pieces until she finishes cutting", I thought this was independent of each turn, so you can just keep stacking them on top of each other.
franzliszt
19.09.2020 02:48
How did you get that?
GammaZero
19.09.2020 02:49
??? I agree that the answer is $\boxed{11}$
franzliszt
19.09.2020 02:52
Yeah you can generalize this with recursions
SparklyFlowers
19.09.2020 02:53
Why am I craving pizza now ;-;
ilovepizza2020
19.09.2020 02:59
SparklyFlowers wrote: Why am I craving pizza now ;-; I am too(hence the username)
bestzack66
19.09.2020 04:09
same lol i am also craving italian food
yofro
19.09.2020 04:29
Richard R. (can't spell that name lol) has a MATHCOUNTS mini on this. What is this source? The problems are very unoriginal
franzliszt
19.09.2020 04:30
This is just famous problem.