Suppose a group of \(n\) people want to split a group of whole cakes among each other. Each cake is of one type only e.g. vanilla, chocolate, strawberry, etc.
###### Problem source: AMST 2015 Power #1c. Image source.

Is it possible to divide the cakes among all \(n\) people such that each person receives *greater than* a total value of \(\frac{1}{n}\)?

If you are confused, see this problem.

×

Problem Loading...

Note Loading...

Set Loading...