User:Daviddaved/Pascal traingle

From Wikibooks, open books for an open world
Jump to: navigation, search

Counting path in a graph a d binomial theorem. Counting paths

The number of paths from the vertex (0,l) to (m,0) is the binomial coefficient and equals .