Rook routes and binomial coefficients

Intermediate Mathematics English
Also available: Deutsch
Created by Best · 17.07.2026 at 11:55 UTC

Count the shortest routes for a piece crossing a grid, moving only right and up one square at a time. The count at a square is the sum of the counts to its left and below, so the grid fills with Pascal's triangle, now larger. The number in the square $f$ right and $r$ up is the binomial coefficient $\binom{f+r}{f}$.

Reading a value directly is choosing which steps go right: a route with $f$ right-steps and $r$ up-steps is a sequence, and choosing the positions of the right-steps among $f+r$ steps gives $\binom{f+r}{f}$ routes. Counting and choosing are the same act.

Chessboard diagram
University approvals: 0
Tasks
Question 1

Fill each inner cell with the number of shortest routes to it (from below + from the left).

Question 2

A route with f right-steps and r up-steps can be counted by:

Question 3

The filled grid of route counts is:

Card Info
  • Topic: Mathematics
  • Difficulty: Intermediate
  • Completed: 0 users
Creator
Best
Best
BestBuddy