ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Scaling conjecture. For all k,m,s∈Nk,m,s\in\mathbb{N},

f(km,ks)=f(m,s).f(km,ks)=f(m,s).

This conjecture is solved; the paper states that it is proved therein, while the second muffin conjecture was previously proved by Cui et al.

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.