benchmarks.wiki / Public workspace

Omni-MATH / Let Z denote the set of all integers. Find all real numbers c>0 such that there exists a labeling of the lattice points (x,y)∈Z² with positive integers for which: only finitely man…

Problem

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

problem

Let Z\mathbf{Z} denote the set of all integers. Find all real numbers c>0c > 0 such that there exists a labeling of the lattice points (x,y)∈Z2( x, y ) \in \mathbf{Z}^2 with positive integers for which: only finitely many distinct labels occur, and for each label ii , the distance between any two points labeled ii is at least cic^i .
Plain-text mathematical notation (without MathML)
Let Z denote the set of all integers. Find all real numbers c>0 such that there exists a labeling of the lattice points (x,y)∈Z² with positive integers for which: only finitely many distinct labels occur, and for each label i , the distance between any two points labeled i is at least c^(i) .
Original LaTeX notation
Let $\mathbf{Z}$ denote the set of all integers. Find all real numbers $c > 0$ such that there exists a labeling of the lattice points $( x, y ) \in \mathbf{Z}^2$ with positive integers for which: only finitely many distinct labels occur, and for each label $i$ , the distance between any two points labeled $i$ is at least $c^i$ .

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