img8 - Chalkdust

Route $z$ connects cities 5 and 6: in total there are $(n-3)(n-4)/2$ routes connecting cities $j$ and $\ell$, where $j, \ell \geq 4$.

Clare Wallace

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$?
Issue 11
Space-filling curves, cheating at cards and automated joke generation feature in our spring 2020 edition. Plus all your favourite puzzles & columns.
Chalkdust Issue 05 coming 7 March
Free launch party, 7.15pm. Come along! Free copies of Chalkdust, free pizza, and buy your own Chalkdust T-shirt.