Find the number of ways to get from one point on a cartesian place to another Find the number of ways to get from point (0, 0) to point (15, 17). You can move (0, 1), (1, 0), (1, 1) but you have to move by (1, 1) exactly 6 times.
You have to make 6 NE moves, 9 E moves and 11 N moves. A total of 26 moves and you can make them in any order, but each order gives a different valid path, so the answer is just $$\frac{26!}{11!9!6!}$$
You have to make 6 NE moves, 9 E moves and 11 N moves. A total of 26 moves and you can make them in any order, but each order gives a different valid path, so the answer is just $$\frac{26!}{11!9!6!}$$