benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / After walking so much that his feet get really tired, the beaver staggers so…

Problem

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

problem

After walking so much that his feet get really tired, the beaver staggers so that, at each step, his coordinates change by either (+1,+1)(+1,+1) or (+1,−1)(+1,-1). Now he walks from (0,0)(0,0) to (8,0)(8,0) without ever going below the xx-axis. How many such paths are there?
Plain-text mathematical notation (without MathML)
After walking so much that his feet get really tired, the beaver staggers so that, at each step, his coordinates change by either (+1,+1) or (+1,−1). Now he walks from (0,0) to (8,0) without ever going below the x-axis. How many such paths are there?
Original LaTeX notation
After walking so much that his feet get really tired, the beaver staggers so that, at each step, his coordinates change by either $(+1,+1)$ or $(+1,-1)$. Now he walks from $(0,0)$ to $(8,0)$ without ever going below the $x$-axis. How many such paths are there?

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
504b3e06-8d7d-5459-a0e9-d76505bf0bb4
task_key
test--504b3e06-8d7d-5459-a0e9-d76505bf0bb4
task_revision_id
1
config / split
/ test

Official source

initial import