benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find the largest integer n such that the following holds: there exists a set of n points in the plane such that, for any choice of three of them, some two are unit distance apart.

Problem

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

problem

Find the largest integer nn such that the following holds: there exists a set of nn points in the plane such that, for any choice of three of them, some two are unit distance apart.
Plain-text mathematical notation (without MathML)
Find the largest integer n such that the following holds: there exists a set of n points in the plane such that, for any choice of three of them, some two are unit distance apart.
Original LaTeX notation
Find the largest integer $n$ such that the following holds: there exists a set of $n$ points in the plane such that, for any choice of three of them, some two are unit distance apart.

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

task_id
bb5a4b3e-c714-507e-a529-5ac80e404095
task_key
test--bb5a4b3e-c714-507e-a529-5ac80e404095
task_revision_id
1
config / split
/ test

Official source

initial import