benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Sam spends his days walking around the following 2×2 grid of squares. Say that two squares are adjacent if they share a side. He starts at the square labeled 1 and every second wal…

Problem

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

problem

Sam spends his days walking around the following 2×22 \times 2 grid of squares. Say that two squares are adjacent if they share a side. He starts at the square labeled 1 and every second walks to an adjacent square. How many paths can Sam take so that the sum of the numbers on every square he visits in his path is equal to 20 (not counting the square he started on)?
Plain-text mathematical notation (without MathML)
Sam spends his days walking around the following 2×2 grid of squares. Say that two squares are adjacent if they share a side. He starts at the square labeled 1 and every second walks to an adjacent square. How many paths can Sam take so that the sum of the numbers on every square he visits in his path is equal to 20 (not counting the square he started on)?
Original LaTeX notation
Sam spends his days walking around the following $2 \times 2$ grid of squares. Say that two squares are adjacent if they share a side. He starts at the square labeled 1 and every second walks to an adjacent square. How many paths can Sam take so that the sum of the numbers on every square he visits in his path is equal to 20 (not counting the square he started on)?

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
739336b0-7fa7-5412-816a-7a830f9ff3d9
task_key
test--739336b0-7fa7-5412-816a-7a830f9ff3d9
task_revision_id
1
config / split
/ test

Official source

initial import