Muffin problem one-third lower-bound conjecture
Statement
Let be the largest possible size of the smallest assigned muffin piece, where is the number of muffins and the number of students.
One-third lower-bound conjecture. For all ,
The conjecture is solved: the paper states that Cui et al. (2018) proved it, and gives a simpler proof.
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.