Binary, Hanoi and Sierpinski, part 1
134 بار بازدید -
6 سال پیش
-
Binary counting can solve the
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).
Thanks to Desmos for their help in supporting this video. They're hiring, and anyone interested should check out https://www.desmos.com/careers
Thanks to all Patreon supporters as well, you can support and get early access to future "Essence of" series here: https://www.patreon.com/3
6 سال پیش
در تاریخ 1397/02/30 منتشر شده
است.
134
بـار بازدید شده