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!
Dear Dirichlet, Issue 19
Game shows, flight and social media bots are among the problems solved in this issue's Dear Dirichlet agony aunt column
The big argument: What’s the best way to end a proof?
QED or $\square$?
Number Rumbler–a new fun maths game!
Maths on Toast is a charity that aims to challenge and change the public's perception of mathematics...