4 ms·
A lot of people have thought really hard about this problem. Plenty of open problems remain: http://en.wikipedia.org/wiki/Packing_problem http://en.wikipedia.o
by ISL 14y ago
A lot of people have thought really hard about this problem. Plenty of open problems remain:
http://en.wikipedia.org/wiki/Packing_problem http://en.wikipedia.org/wiki/Packing_problem
- Someone 14y agoAnd for this particular problem: http://en.wikipedia.org/wiki/Close-packing_of_equal_spheres http://en.wikipedia.org/wiki/Close-packing_of_equal_spheres http://demonstrations.wolfram.com/SpherePacking/ http://demonstrations.wolfram.com/SpherePacking/ http://www.maa.org/devlin/devlin_9_98.html http://www.maa.org/devlin/devlin_9_98.html (nb: that proof is for infinitely many spheres. For finitely many, the problem is, AFAIK, still widely open. 361 likely is close to infinitely many, though, if your box isn't weirdly formed)