Key to the Tower of Hanoi - Numberphile
26:51
New divisibility rule! (30,000 of them)
26:51
A New Tile in Newtyle - Numberphile
39:23
The ultimate tower of Hanoi algorithm
7:50
Tower of Hanoi, 8 disks. Only 255 moves requires to solve it.
17:12
A Problem with Rectangles - Numberphile
12:18
Recursion 'Super Power' (in Python) - Computerphile
14:33
The Doomsday Algorithm - Numberphile
21:13