00:01
So in this question we're thinking about shortest lattice paths, and for a short lattice path between x, y, or x1, y1, to x2, y2, that means we have x2 minus x1 x jumps, and y2 minus y1 y jumps.
00:24
So the number of different paths are the ways of reordering these.
00:29
So the number of paths is going to be the sum of the number of jumps, so x2 plus y2 minus x1 minus y1 factorial, divided by the number of ways of reordering the jumps inside here.
00:49
So x2 minus x1 factorial, y2 minus y1 factorial.
00:59
So what that is, is x2 minus x1 plus y2 minus y1, choose x2 minus x1.
01:11
So first of all, if we start at 5, 5, and go to 13, 13, then our differences are 8 and 8.
01:27
So that means that the number of paths is 16 choose 8.
01:34
So 16 choose 8 is 12 ,870 paths...