benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find all positive integers n such that the unit segments of an n×n grid of unit squares can be partitioned into groups of three such that the segments of each group share a common …

Problem

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

problem

Find all positive integers nn such that the unit segments of an n×nn \times n grid of unit squares can be partitioned into groups of three such that the segments of each group share a common vertex.
Plain-text mathematical notation (without MathML)
Find all positive integers n such that the unit segments of an n×n grid of unit squares can be partitioned into groups of three such that the segments of each group share a common vertex.
Original LaTeX notation
Find all positive integers $n$ such that the unit segments of an $n \times n$ grid of unit squares can be partitioned into groups of three such that the segments of each group share a common vertex.

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
de69d259-1fae-5fbe-873a-541ed5aa8f0f
task_key
test--de69d259-1fae-5fbe-873a-541ed5aa8f0f
task_revision_id
1
config / split
/ test

Official source

initial import