benchmarks.wiki / Public workspace

MATH / How many paths are there from C to D on the grid shown, if every step must be down or to the right?[asy]size(4cm,4cm);int w=5;int h=7;int i;for (i=0; i<h; ++i)draw((0,i) -- (w-1,i)… · Discussion

Discussing How many paths are there from C to D on the grid shown, if every step must be down or to the right?[asy]size(4cm,4cm);int w=5;int h=7;int i;for (i=0; i<h; ++i)draw((0,i) -- (w-1,i)… · 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.