benchmarks.wiki / Public workspace

Omni-MATH / In how many ways can the numbers 1,2,…,2002 be placed at the vertices of a regular 2002-gon so that no two adjacent numbers differ by more than 2? (Rotations and reflections are co…

Problem

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

problem

In how many ways can the numbers 1,2,…,20021,2, \ldots, 2002 be placed at the vertices of a regular 2002-gon so that no two adjacent numbers differ by more than 2? (Rotations and reflections are considered distinct.)
Plain-text mathematical notation (without MathML)
In how many ways can the numbers 1,2,…,2002 be placed at the vertices of a regular 2002-gon so that no two adjacent numbers differ by more than 2? (Rotations and reflections are considered distinct.)
Original LaTeX notation
In how many ways can the numbers $1,2, \ldots, 2002$ be placed at the vertices of a regular 2002-gon so that no two adjacent numbers differ by more than 2? (Rotations and reflections are considered 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

Official source

initial import