img7

Published at 548 × 435 in A tale of $n$ cities

The two routes x$ and $y$ connect city 6 with cities 2 and 3: in total there are $2(n-3)$ routes connecting cities 4 to $n$ to cities 2 and 3. Together, routes $x,y, p_1, p_2, p_5$ and $p_n$ form a tale of four cities.

Clare (like gare) is a Chalkdust editor. In her spare time, she’s an assistant professor at Durham University. She likes Skittles, probability, and making the magazine look more like Cosmo.
All articles by Clare

More from Chalkdust

Both comments and trackbacks are currently closed.