In Jan 2009 this email list discussed the Muffin Problem which was due to Alan Frank: You have m muffins to give out to s students. You want to give everyone m/s muffins. How to divide-and-distribute and maxmize the min piece. We let f(m,s) be the size of the smallest piece in the opt procedure. I saw the problem at Gathering for Gardner 2016 and worked on it for two years (unaware of the discussions on this list). I read over all the discussion done here (thanks to Jim Propp's arxiv of it) and there was not much overlap: 1) Erich Friedman prove f(m,s) = (m/s)f(s,m) 2) Veit Elser proved that f(m,s) can be computed by a Mixed Int Program 3) Someone conjectured that for m>s f(m,s) \ge 1/3. That last conjecture we proved! Here are pointers to where to look for our work 1) Conference proceeding for FUN with Algorihtms: https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/ffmuff.pdf The appendix has the proof of f(m,s) \ge 1/3 2) slides on a talk I give on the problem: https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/muffintalk.pdf 3) the long long papers on it on arxiv (not recommended- but one day it will be better) https://arxiv.org/abs/1709.02452