Maths Olympiad Prep

Library / /641 of 740

, 2019

Combinatorics Difficulty 5.5 AIME, harder Prove it United States

Problem:

An up-right path between two lattice points PP and QQ is a path from PP to QQ that takes steps of 1 unit either up or to the right. A lattice point (x,y)(x, y) with 0x,y50 \leq x, y \leq 5 is chosen uniformly at random. Compute the expected number of up-right paths from (0,0)(0,0) to (5,5)(5,5) not passing through (x,y)(x, y).

Solution

Solution:

For a lattice point (x,y)(x, y), let F(x,y)F(x, y) denote the number of up-right paths from (0,0)(0,0) to (5,5)(5,5) that don't pass through (x,y)(x, y), and let
S=0x50y5F(x,y) S=\sum_{0 \leq x \leq 5} \sum_{0 \leq y \leq 5} F(x, y)
Our answer is S36\frac{S}{36}, as there are 36 lattice points (x,y)(x, y) with 0x,y50 \leq x, y \leq 5.
Notice that the number of up-right paths from (0,0)(0,0) to (5,5)(5,5) is (105)=252\binom{10}{5}=252 because each path consists of 10 steps, of which we can choose 5 to be to the right. Each of these paths passes through 11 lattice points (x,y)(x, y) with 0x,y50 \leq x, y \leq 5, so each path contributes 3611=2536-11=25 to the quantity we are counting in SS. Then S=25252S=25 \cdot 252, so our answer is 2525236=175\frac{25 \cdot 252}{36}=175.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.