Why colliding blocks compute pi

Original Media · 26m · English · YouTube · 3Blue1Brown

TLDR

The video revisits the colliding blocks puzzle where two blocks on a frictionless plane with a wall produce a total collision count matching the digits of pi when the mass ratio is a power of 100. It explains the geometric solution using conservation of energy and momentum in a rescaled velocity state space, where the dynamics become a zigzag path on a circle. The connection to pi arises from a small-angle approximation (arctan(x) ≈ x), but the exact equivalence is technically an unsolved problem because it requires proving pi's decimal expansion never contains a run of n consecutive 9s starting at position n. The video also teases a hidden connection to Grover's quantum search algorithm.

For you

PRO members can sign in and request more information — or their own version of this digest, tuned to what they care about.

Sign in to unlock

Surprising Insights

•

The connection to pi is technically an unsolved problem because it depends on unproven properties of pi's digits (no long runs of 9s at specific positions).

•

The exact same mathematical structure appears in Grover's quantum search algorithm, linking classical block collisions to quantum computing.

•

The collision count matches pi's digits only because of a small-angle approximation; the true angle is arctan(10⁻ᵏ), not exactly 10⁻ᵏ.

•

The initial velocity of the large block doesn't affect the total collision count, only the time scale of the experiment.

•

The problem works in any base: binary mass ratios (powers of 4) yield pi's binary digits.

Key takeaways

•

The colliding blocks puzzle maps to a geometric problem on a circle in velocity state space: conservation of energy defines the circle, and conservation of momentum defines chords with slope -√(m₁/m₂).

•

Each block-block collision corresponds to moving along a chord down and right; each wall collision reflects the point vertically. The process ends when the state enters the 'end zone' where both blocks move right with the small block slower.

•

The total collision count equals the number of equal arcs of angle 2θ that fit in the upper half-circle, where tan(θ) = √(m₂/m₁).

•

When the mass ratio is a power of 100, θ ≈ 10⁻ᵏ due to the small-angle approximation (arctan(x) ≈ x), making the collision count share digits with pi.

•

The exact equivalence to pi's digits is technically an unsolved problem: it requires proving pi's decimal expansion never has a run of n consecutive 9s starting at position n, which current mathematics cannot prove.

•

The same phenomenon works in any base: mass ratios that are powers of base² produce collision counts matching pi's digits in that base (e.g., powers of 4 for binary).

•

Idealized physics models, while unrealistic, expose deep mathematical connections — here linking classical mechanics to quantum computing (Grover's algorithm).

•

Problem-solving principles demonstrated: list relevant equations, draw pictures/state spaces, exploit symmetries (rescaling to a circle), and translate dynamics into geometry.

Notable quotes

“which I suspect no one in the world knew, which is how this is all secretly connected to quantum computing, more specifically, something known as Grover's algorithm for search.”

▸ Notable quotes · 0:23

“but very technically speaking, that full connection to pi is an unsolved problem.”

▸ Notable quotes · 0:37

“this particular state space for us holds within it the key connection to the quantum computing parallel that we're going to be building up to.”

▸ Notable quotes · 7:26

“When you say pi is equal to 3.141, you can fit in 3,141 thousandths, and adding one more would bust you above pi.”

▸ Notable quotes · 17:54

“However, rigorously proving that this is true of the digits of pi is beyond the scope of what the current tools of math can prove.”

▸ Notable quotes · 22:44

“It's because distilling a problem into its core essence can expose hidden connections, and it's through those connections that mathematicians make progress.”

▸ Notable quotes · 25:22

Chapters

•

0:00 — Introduction and puzzle recap: The video reintroduces the colliding blocks puzzle: two blocks on a frictionless plane with a wall, where the total collision count matches pi's digits when the mass ratio is a power of 100. It mentions the unsolved nature of the exact pi connection and a surprise link to quantum computing.

•

4:04 — Physics setup and conservation laws: The speaker sets up the physics: conservation of kinetic energy and momentum. He introduces the idea of a state space with coordinates (v₁, v₂) and suggests drawing pictures to visualize the dynamics.

•

7:26 — Rescaling to a circle and geometric interpretation: By rescaling coordinates to √m₁v₁ and √m₂v₂, the energy conservation equation becomes a circle. Momentum conservation becomes a family of lines with slope -√(m₁/m₂). Collisions correspond to moving between intersection points of these lines and the circle.

•

14:42 — Inscribed angle theorem and counting arcs: Using the inscribed angle theorem, the speaker shows that each block-block collision advances the state point by a fixed arc of 2θ along the circle, where tan(θ) = √(m₂/m₁). The total number of collisions equals the number of such arcs that fit before entering the end zone.

•

17:18 — Small-angle approximation and pi digits: For mass ratios that are powers of 100, θ = arctan(10⁻ᵏ) ≈ 10⁻ᵏ. The collision count becomes the largest integer n such that n·θ < π, which yields the digits of pi due to the definition of decimal representation.

•

21:40 — The unsolved problem: off-by-one errors: The small-angle approximation introduces a tiny error. If pi's digits ever contained a run of n consecutive 9s starting at position n, the approximation would cause an off-by-one error. Proving this never happens is beyond current mathematics, making the exact pi connection technically unsolved.

•

23:11 — Generalization to other bases and justification for idealization: The phenomenon works in any base: mass ratios that are powers of base² produce pi's digits in that base. The speaker defends idealized models as a way to expose hidden connections, citing the analogy to light bouncing between mirrors.

•

24:31 — Hidden connections and quantum computing teaser: The video concludes by emphasizing that stripping away real-world messiness reveals deep connections — here, a secret mirroring of the block collision solution in Grover's quantum search algorithm, to be explored in a follow-up video.

Speakers

•

Speaker 1 — Host/Narrator

⋮