benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Points X and Y are inside a unit square. The score of a vertex of the square is the minimum distance from that vertex to X or Y. What is the minimum possible sum of the scores of t…

Problem

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

problem

Points XX and YY are inside a unit square. The score of a vertex of the square is the minimum distance from that vertex to XX or YY. What is the minimum possible sum of the scores of the vertices of the square?
Plain-text mathematical notation (without MathML)
Points X and Y are inside a unit square. The score of a vertex of the square is the minimum distance from that vertex to X or Y. What is the minimum possible sum of the scores of the vertices of the square?
Original LaTeX notation
Points $X$ and $Y$ are inside a unit square. The score of a vertex of the square is the minimum distance from that vertex to $X$ or $Y$. What is the minimum possible sum of the scores of the vertices of the square?

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
e2d530be-18a6-5d73-b513-a1d693261ccc
task_key
test--e2d530be-18a6-5d73-b513-a1d693261ccc
task_revision_id
1
config / split
/ test

Official source

initial import