img6 - Chalkdust

n cities, joined by n routes: the first n-1 connect City 1 to each of the others, and the nth connects City 2 to City 3.

The first $n$ routes

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.

In conversation with Christopher Lillicrap
Adam Townsend and Clare Wallace talk to the children’s programme creator about writing for younger generations
Chalkdust dissertation prize 2025
Calling all final-year students! This is your opportunity to get your work published as a Chalkdust article.
Chalkdust dissertation prize
Calling all final-year students!
The big argument: What’s the best way to end a proof?
QED or $\square$?
Top ten vote issue 14
Have your say on the top ten matrices
Mathematicians and their Gods
Believe it or not: Mathematics and Theology can coexist