Jump to content

Disk covering problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 04:51, 17 February 2007 (moved Disk Covering Problem to Disk covering problem: downcasing per conventions). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The disk covering problem was proposed by Zahn in 1962.

What is the smallest radius r(n) required for n equal disks to cover the unit disk?

References

Weisstein, Eric W. "Disk Covering Problem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/DiskCoveringProblem.html

Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Disk_covering_problem&oldid=108781203"