# Counting Paths through a Grid

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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.

Contributed by: George Beck and Rob Morris (March 2011)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

detailSectionParagraph## Permanent Citation

"Counting Paths through a Grid"

http://demonstrations.wolfram.com/CountingPathsThroughAGrid/

Wolfram Demonstrations Project

Published: March 7 2011