Last modified on 3 September 2012, at 03:56

User:Daviddaved/Pascal traingle

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 .