benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A beaver walks from (0,0) to (4,4) in the plane, walking one unit in the positive x direction or one unit in the positive y direction at each step. Moreover, he never goes to a poi…

Problem

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

problem

A beaver walks from (0,0)(0,0) to (4,4)(4,4) in the plane, walking one unit in the positive xx direction or one unit in the positive yy direction at each step. Moreover, he never goes to a point (x,y)(x, y) with y>xy>x. How many different paths can he walk?
Plain-text mathematical notation (without MathML)
A beaver walks from (0,0) to (4,4) in the plane, walking one unit in the positive x direction or one unit in the positive y direction at each step. Moreover, he never goes to a point (x,y) with y>x. How many different paths can he walk?
Original LaTeX notation
A beaver walks from $(0,0)$ to $(4,4)$ in the plane, walking one unit in the positive $x$ direction or one unit in the positive $y$ direction at each step. Moreover, he never goes to a point $(x, y)$ with $y>x$. How many different paths can he walk?

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
901a74b4-95de-568d-8d0c-3df29e4819d1
task_key
test--901a74b4-95de-568d-8d0c-3df29e4819d1
task_revision_id
1
config / split
/ test

Official source

initial import