TubeSum ← Transcribe a video

Disc-Covering Puzzle Explained — Full Breakdown & Transcript

0h 01m video Published Nov 19, 2024 Transcribed Aug 10, 2026 3 3Blue1Brown
Intermediate 2 min read For: Math enthusiasts and puzzle solvers interested in geometric proofs.
AI Trust Score 70/100
⚠️ Average / Some Fluff

"The title accurately reflects the content—it's a puzzle that indeed seems trickier than it appears, and the video explains why."

AI Summary

This video clarifies a subtle point about a mathematical puzzle involving covering a unit disc with strips. The challenge is to prove that the sum of the widths of any covering strips cannot be less than the disc's diameter (2). The speaker explains why the obvious parallel-strip solution is not trivially optimal, because width is not proportional to area, making the proof non-trivial.

[00:01]
Puzzle Setup

A disc of radius 1 is covered by strips (regions bounded by two parallel lines). The goal is to minimize the sum of the strips' widths.

[00:26]
Obvious Solution

Using parallel strips, the sum of widths equals the diameter (2). This seems optimal because overlap appears wasteful.

[00:55]
Key Insight

The width of a strip is not proportional to its area. A fat strip near the edge can have larger width but smaller area than a thinner strip near the center, so overlap might trade area efficiency for width efficiency.

[01:20]
The Challenge

The real challenge is to rigorously prove that no clever covering can achieve a sum of widths less than the diameter (2). This is not obvious and requires a beautiful solution.

The video sets up a deceptively simple puzzle where the obvious solution is not trivially optimal, highlighting the need for a rigorous proof that the sum of strip widths cannot be less than the disc's diameter.

Study Flashcards (4)

What is the puzzle's setup?

easy Click to reveal answer

A disc of radius 1 is covered by strips (regions between parallel lines), and the goal is to minimize the sum of the strips' widths.

00:01

What is the sum of widths if you use parallel strips?

easy Click to reveal answer

The sum equals the diameter of the circle, which is 2.

00:26

Why is the parallel-strip solution not obviously optimal?

medium Click to reveal answer

Because the width of a strip is not proportional to its area; a fat strip near the edge can have larger width but smaller area than a thinner strip near the center, so overlap might be beneficial.

00:55

What is the challenge of the puzzle?

medium Click to reveal answer

To rigorously prove that the sum of strip widths cannot be less than the diameter (2).

01:20

💡 Key Takeaways

💡

Width vs. Area

This is the crux of the puzzle—it explains why the obvious solution is not trivially optimal.

00:55
⚖️

The Proof Challenge

It sets up the intellectual challenge that the main video addresses.

01:20

[00:01] video and based on a couple comments I realized that I could have been clearer about what makes this puzzle tricky the question starts by supposing that you have a disc with radius one and you cover it with a whole bunch of strips

[00:13] when I say strip here I mean a region that's Bound by two parallel lines and the quantity that you'll care about is the width of that strip the distance between those lines the question is supposing that your strips completely

[00:26] cover the disc what is the smallest possible value for the sum of all of those widths for example if you just used a bunch of parallel strips then the sum of all of the widths would be the diameter of the circle which is two Now

[00:41] spoiler alert it turns out that two is the smallest that you can get and a don't see the point this is obvious parallel strips should be optimal CU otherwise you would have some kind of overlap and overlap is clearly wasteful

[00:55] that would be true if we were trying to minimize the total area that these strips have in that case overlap is necessarily a waste of area but that's not the challenge the tricky part here is that the width of a strip is not

[01:08] proportional to the area it's perfectly possible to have a very fat strip near the edge of the circle with a bigger width but a smaller area than a thinner strip near the center of the circle so for all you know there might be a clever

[01:20] covering that has a little overlap here and there which trades off an inefficient use of area for a more efficient use of the total width the challenge is to find find a rigorous way to prove that this is not possible that

[01:33] cannot be lower than the diameter of the circle it's really not an obvious fact and if you appreciate this it makes the solution that we cover in the main video all the more beautiful

More from 3Blue1Brown

View all

⚡ Saved you 0h 01m reading this? Transcribe any YouTube video for free — no signup needed.