How ternary counting reveals the structure of the Sierpinski triangle

Binary, Hanoi, and Sierpinski, part 2 · 13:40 · Video: 3Blue1Brown · Watch at the source

In short: Explore the mathematical connection between base-3 counting and fractal geometry. This video demonstrates how ternary counting provides a solution to a constrained version of the Towers of Hanoi puzzle and maps out the Sierpinski triangle graph.

Building on the relationship between binary counting and the standard Towers of Hanoi, this exploration introduces ternary counting. By applying this base-3 system to a constrained version of the puzzle, a clear path emerges through the complex, recursive structure of the Sierpinski triangle graph.

Opens the Intellect+ feed with this card first. Swipe up for the next one.

Sources

To cite this card, link to https://intellectplus.co.uk/app/science-binary-hanoi-and-sierpinski-part-2.

How we source, check and correct cards: Editorial standards.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

Finding something worth knowing…