Equitable full-cookie distribution conjecture
Statement
Let , , and be positive integers. A group of children has cookies, each with some amount of one or more of possible kinds of frosting.
Equitable distribution conjecture. It should be possible to cut at most cookies and distribute them so that each child has the same amount of each kind of frosting and at least
full cookies.
The bound would be optimal because an equitable distribution of all full cookies can give each child at most full cookies. The conjecture strengthens the paper's theorem by improving its guaranteed number of full cookies while retaining the optimal cut bound.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.