3Blue1Brown
June 16, 2026
TL;DR
A mathematical puzzle exploring how many intersection points are expected when 10 or 100 random chords are drawn on a circle, building on Bertrand's paradox.
“I hear some of you say, I remember something fishy about choosing random chords on a circle. That is right. There's a famous paradox here called Bertrand's paradox.”
— Presenter
“When I say choose a random chord, I mean start by choosing one point uniformly on the circle.”
— Presenter
1. Introduction to the Puzzle
The presenter introduces the main puzzle: calculating the expected number of intersection points for 10 and 100 random chords on a circle.
2. Bertrand's Paradox and Precision
Discussion of Bertrand's paradox and the importance of precisely defining what 'random chord' means to avoid ambiguity.
3. Defining Random Chord Selection
Clear mathematical definition: choose two points uniformly at random on the circle's circumference and connect them.
4. The Challenge Ahead
The presenter poses the computational challenge and hints at connections to previous puzzles in the series.