Geometry puzzle to end off 2022! Disk covering problem

preview_player
Показать описание
#maths #mathematics #puzzle

The disk covering problem asks for the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit disk. Dually, for a given radius epsilon, one wishes to find the smallest integer n such that n disks of radius epsilon can cover the unit disk.

Hope you enjoy this little #geometry puzzle which you can use to challenge your friends!

There's one final Codeforces contest in a couple of hours' time if you are interested. See you in 2023 with math olympiad / competitive programming videos on USAMO, APMO, IMO, Google Code Jam, and more!
Рекомендации по теме
Комментарии
Автор

In the disk covering problem, all disks include their circumference. Share your proofs for n=3 below!

dedekindcuts
Автор

Hey, could I please know the proof for n=5?

ChardRei