×
Carregamento em andamento

Binary, Hanoi, and Sierpinski, part 1

1 membro

Binary counting can solve the towers of Hanoi puzzle, and if this isn't surprising enough, it can lead to a method for finding a curve that fills Sierpinski's triangle (which I get to in part 2).

Próximo episódio
S2016E22 - Binary, Hanoi, and Sierpinski, part 2

Episódios

Séries similares (10)

Science étonnante
Science étonnante
Numberphile
Numberphile
CGP Grey
CGP Grey
Mathologer
Mathologer
Déclics
Déclics
Team Umizoomi
Team Umizoomi
In a Nutshell – Kurzgesagt
In a Nutshell – Kurzgesagt
Programa Cautelar
Programa Cautelar
MinutePhysics
MinutePhysics
Numb3rs
Numb3rs