I believe N(m,s) = m + s - gcd(m,s) pieces is your answer. This problem is more interesting for multi-way generalizations of the muffin problem. I suspect it is tractable. - Scott On Mon, Aug 24, 2020 at 4:47 PM Dan Asimov <dasimov@earthlink.net> wrote:
Define N(m,s) as *the minimum number of pieces* necessary to distribute m/s muffins to each of s students, starting from m whole muffins.
Is N(m,s) easy to determine?
—Dan
Jim Propp wrote: ----- ... the original muffin problem, f(m,s) (defined as the maximum possible size of the smallest piece among all ways of distributing m muffins among s students) ... -----
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun