benchmarks.wiki / Public workspace

Omni-MATH / A restricted path of length n is a path of length n such that for all i between 1 and n−2 inclusive, if the ith step is upward, the i+1st step must be rightward. Find the number of…

Problem

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

problem

A restricted path of length nn is a path of length nn such that for all ii between 1 and n−2n-2 inclusive, if the iith step is upward, the i+1i+1st step must be rightward. Find the number of restricted paths that start at (0,0)(0,0) and end at (7,3)(7,3).
Plain-text mathematical notation (without MathML)
A restricted path of length n is a path of length n such that for all i between 1 and n−2 inclusive, if the ith step is upward, the i+1st step must be rightward. Find the number of restricted paths that start at (0,0) and end at (7,3).
Original LaTeX notation
A restricted path of length $n$ is a path of length $n$ such that for all $i$ between 1 and $n-2$ inclusive, if the $i$th step is upward, the $i+1$st step must be rightward. Find the number of restricted paths that start at $(0,0)$ and end at $(7,3)$.

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