Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Disk Covering Problem

    Illustration

    Illustration

    Definition

    Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are r(1) | = | 1 r(2) | = | 1 r(3) | = | 1/2 sqrt(3) r(4) | = | 1/2 sqrt(2) r(5) | = | 0.609383... r(6) | ≈ | 0.555 r(7) | = | 1/2 r(8) | ≈ | 0.437 r(9) | ≈ | 0.422 r(10) | ≈ | 0.398.

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.