# Solution

(related to Problem: A Bank Holiday Puzzle)

The simplest way is to write in the number of routes to all the towns in this manner. Put a $1$ on all the towns in the top row and in the first column. Then the number of routes to any town will be the sum of the routes to the town immediately above and to the town immediately to the left. Thus the routes in the second row will be $1,$ 2, $3,$ 4, $5,$ 6, etc., in the third row, $1,$ $3,$ $6,$ $10,$ $15,$ $21,$ etc.; and so on with the other rows. It will then be seen that the only town to which there are exactly $1,365$ different routes is the twelfth town in the fifth row — the one immediately over the letter $E.$ This town was, therefore, the cyclist's destination.

The general formula for the number of routes from one corner to the corner diagonally opposite on any such rectangular reticulated arrangement, under the conditions as to direction, is $$\frac{(m + n) &#33;}{m &#33;n &#33;},$$ where m is the number of towns on one side, less one, and n the number on the other side, less one. Our solution involves the case where there are $12$ towns by $5.$ Therefore m = $11$ and $n = 4.$ Then the formula gives us the answer $1,365$ as above.

Github: non-Github:
@H-Dudeney

### References

#### Project Gutenberg

1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.