Following the simple connections Leonhard Euler found inside difficult problems—and the engineering world built on top of them.
A place for the ideas, papers and theorems I want to understand slowly, explain simply and return to often.
A place I genuinely love
Project Euler
I genuinely love Project Euler. It makes mathematics feel active: begin with a small question, write a program, notice a pattern, and finish with an idea that stays with you.
Each idea follows the same path: begin with a real problem, simplify it, understand Euler's move, and then connect it to engineering.
01 · Graph theory
Can I cross every bridge exactly once?
Euler's breakthrough was not finding a clever walking route. It was proving that no such route could exist.
Remove the geography.Land regions become nodes. Bridges become edges.
Count each node's degree.The degree is simply the number of connected bridges.
Apply the odd-degree rule.A walk using every edge once can have at most two odd-degree nodes. Königsberg had four.
Modern application · Movement cycles
A Rubik's Cube, flattened into moving cycles
The animation turns the cube into a flat map. Instead of hiding stickers on the back and bottom, it places every sticker position on a visible circular track.
A Rubik's Cube turn represented as movement through a graphThe top layer of a three-dimensional cube turns. At the same time, a matching ring in a flat circular map rotates its colored sticker positions. The flat map makes all six cube faces visible at once.
1 · Every colored dot is a sticker position2 · One layer turn rotates dots around one circle3 · The flat map shows all six faces at once
Each colored dot is a sticker position.The flat picture lets us see the cube's six faces at the same time.
Each circle represents a movable layer.The cube has three layers along each of three axes, giving nine layer cycles in this view.
A turn moves several dots together.Watch one cube layer and its matching circular track rotate at the same moment.
One surprising result
However scrambled it looks, every position can be solved in at most 20 moves when a quarter-turn or half-turn of any face counts as one move. The graph-theory version of this statement is: the cube graph's farthest node is 20 edges from solved.