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… · Discussion

Discussing 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… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.