benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Can the set of lattice points {(x,y)∣x,y∈Z,1≤x,y≤252,x≠y} be colored using 10 distinct colors such that for all a≠b,b≠c, the colors of (a,b) and (b,c) are distinct?

Problem

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

problem

Can the set of lattice points {(x,y)∣x,y∈Z,1≤x,y≤252,x≠y}\{(x, y) \mid x, y \in \mathbb{Z}, 1 \leq x, y \leq 252, x \neq y\} be colored using 10 distinct colors such that for all a≠b,b≠ca \neq b, b \neq c, the colors of (a,b)(a, b) and (b,c)(b, c) are distinct?
Plain-text mathematical notation (without MathML)
Can the set of lattice points {(x,y)∣x,y∈Z,1≤x,y≤252,x≠y} be colored using 10 distinct colors such that for all a≠b,b≠c, the colors of (a,b) and (b,c) are distinct?
Original LaTeX notation
Can the set of lattice points $\{(x, y) \mid x, y \in \mathbb{Z}, 1 \leq x, y \leq 252, x \neq y\}$ be colored using 10 distinct colors such that for all $a \neq b, b \neq c$, the colors of $(a, b)$ and $(b, c)$ are distinct?

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
ca06af51-4167-544c-8842-29908fa4ecf0
task_key
test--ca06af51-4167-544c-8842-29908fa4ecf0
task_revision_id
1
config / split
/ test

Official source

initial import