25 Oct
2008
25 Oct
'08
4:38 a.m.
By the way, Kevin Buzzard & I just realized that this M/m problem is (trivially) equivalent to the "Penny Problem": -- Given n non-overlapping* unit disks in the plane, what is the smallest R = R(n) for which they can be arranged inside of a disk of radius R ? Neil, did you do any numerical work on this question? --Dan _____________________________________ * other than possible tangencies. _____________________________________________________________________ "It don't mean a thing if it ain't got that certain je ne sais quoi." --Peter Schickele