benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / How many 9-step paths are there from E to G?[asy]size(4cm,4cm);int w=6;int h=5;int i;for (i=0; i<h; ++i)draw((0,i) -- (w-1,i));for (i=0; i<w; ++i)draw((i, 0)--(i,h-1));label("G", (… · Discussion

Discussing How many 9-step paths are there from E to G?[asy]size(4cm,4cm);int w=6;int h=5;int i;for (i=0; i<h; ++i)draw((0,i) -- (w-1,i));for (i=0; i<w; ++i)draw((i, 0)--(i,h-1));label("G", (… · 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.