ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(m,s)f(m,s) be the largest possible size of the smallest assigned muffin piece, where mm is the number of muffins and ss the number of students.

One-third lower-bound conjecture. For all m>s≥2m>s\geq 2,

f(m,s)≥1/3.f(m,s)\geq 1/3.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.