ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rr, nn, and mm be positive integers. A group of rr children has nn cookies, each with some amount of one or more of mm possible kinds of frosting.

Equitable distribution conjecture. It should be possible to cut at most (r−1)m(r-1)m cookies and distribute them so that each child has the same amount of each kind of frosting and at least

⌊n−m(r−1)r⌋\left\lfloor \frac{n-m(r-1)}{r}\right\rfloor

full cookies.

The bound would be optimal because an equitable distribution of all full cookies can give each child at most ⌊n−m(r−1)r⌋\left\lfloor\frac{n-m(r-1)}{r}\right\rfloor 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 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.