benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let Ω=(x,y,z)∈Z³:y+1≥x≥y≥z≥0. A frog moves along the points of Ω by jumps of length 1. For every positive integer n, determine the number of paths the frog can take to reach … · Discussion

Discussing Let Ω={(x,y,z)∈Z³:y+1≥x≥y≥z≥0}. A frog moves along the points of Ω by jumps of length 1. For every positive integer n, determine the number of paths the frog can take to reach … · 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.