benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Sally the snail sits on the 3×24 lattice of points (i,j) for all 1≤i≤3 and 1≤j≤24. She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point …

Problem

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

problem

Sally the snail sits on the 3×243 \times 24 lattice of points (i,j)(i, j) for all 1≤i≤31 \leq i \leq 3 and 1≤j≤241 \leq j \leq 24. She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point in the lattice exactly one unit away. Given that Sally starts at (2,1)(2,1), compute the number of possible paths Sally can take.
Plain-text mathematical notation (without MathML)
Sally the snail sits on the 3×24 lattice of points (i,j) for all 1≤i≤3 and 1≤j≤24. She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point in the lattice exactly one unit away. Given that Sally starts at (2,1), compute the number of possible paths Sally can take.
Original LaTeX notation
Sally the snail sits on the $3 \times 24$ lattice of points $(i, j)$ for all $1 \leq i \leq 3$ and $1 \leq j \leq 24$. She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point in the lattice exactly one unit away. Given that Sally starts at $(2,1)$, compute the number of possible paths Sally can take.

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
0fc89d98-83f4-5d7e-ac0c-3ef1a2b23ddc
task_key
test--0fc89d98-83f4-5d7e-ac0c-3ef1a2b23ddc
task_revision_id
1
config / split
/ test

Official source

initial import