# Counting Paths through a Grid

Counting Paths through a Grid

A downward path joins the top spot A to the variable bottom spot B. For a fixed B, there are " choose " = possible paths, where is the row number and counts how far B is along its row, with both and starting at zero. These numbers are the binomial coefficients that form Pascal's triangle.

n

k

n |

k |

n

k

n

k