benchmarks.wiki / Public workspace

Omni-MATH / ( Gregory Galperin ) A square grid on the Euclidean plane consists of all points…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

( Gregory Galperin ) A square grid on the Euclidean plane consists of all points (m,n)(m,n) , where mm and nn are integers . Is it possible to cover all grid points by an infinite family of discs with non-overlapping interiors if each disc in the family has radius at least 5?
Plain-text mathematical notation (without MathML)
( Gregory Galperin ) A square grid on the Euclidean plane consists of all points  (m,n) , where m and n are integers .  Is it possible to cover all grid points by an infinite family of discs with non-overlapping interiors if each disc in the family has radius at least 5?
Original LaTeX notation
( Gregory Galperin ) A square grid on the Euclidean plane consists of all points  $(m,n)$ , where $m$ and $n$ are integers .  Is it possible to cover all grid points by an infinite family of discs with non-overlapping interiors if each disc in the family has radius at least 5?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import