Skip to main content
Donate

Up Next

Singularities Explained

Singularities Explained

Season 1 Episode 9
10:22
Kill the Mathematical Hydra

Kill the Mathematical Hydra

Season 1 Episode 10
13:29
How Infinity Explains the Finite

How Infinity Explains the Finite

Season 1 Episode 11
11:46
The Mathematics of Quantum Computers

The Mathematics of Quantum Computers

Season 1 Episode 12
12:35
Splitting Rent with Triangles

Splitting Rent with Triangles

Season 1 Episode 13
16:21
Infinite Chess

Infinite Chess

Season 1 Episode 14
13:21
Proving Pick's Theorem

Proving Pick's Theorem

Season 1 Episode 16
11:17
What is a Random Walk?

What is a Random Walk?

Season 1 Episode 17
12:35
Solving the Wolverine Problem with Graph Coloring

Solving the Wolverine Problem with Graph Coloring

Season 1 Episode 18
13:10
Can We Combine pi & e to Make a Rational Number?

Can We Combine pi & e to Make a Rational Number?

Season 1 Episode 19
13:29
How to Break Cryptography

How to Break Cryptography

Season 1 Episode 20
15:37
Hacking at Quantum Speed with Shor's Algorithm

Hacking at Quantum Speed with Shor's Algorithm

Season 1 Episode 21
16:35
Back to Show
Infinite Series

Can a Chess Piece Explain Markov Chains?

Season 1 Episode 8

In this episode probability mathematics and chess collide. What is the average number of steps it would take before a randomly moving knight returned to its starting square?
Stream on your TV