Covering 10 points, a surprisingly tricky puzzle.
A mathematical puzzle is presented asking whether 10 arbitrary points on a 2D plane can always be covered by non-overlapping unit discs (radius 1). The puzzle explores edge cases from covering all points with one disc to requiring individual discs for each point.
Summary
The transcript presents a geometric puzzle involving 10 points placed anywhere on a two-dimensional plane. The challenge is to determine whether these points can always be covered using unit discs (discs with radius 1) that must be completely disjoint - meaning they cannot overlap at all. The speaker provides two illustrative scenarios to frame the problem: if all 10 points are clustered close together, a single unit disc could potentially cover them all; conversely, if the points are spread far apart from each other, each point would require its own individual disc for coverage. The core question posed is whether this covering is always mathematically possible regardless of the spatial configuration of the 10 points, making this a universal feasibility problem in computational geometry.
Key Insights
- The speaker presents a puzzle about covering 10 arbitrary points on a 2D plane with non-overlapping unit discs
- The discs must have a radius of exactly one unit and cannot overlap with each other
- If all 10 points are sufficiently close together, they could potentially be covered by a single disc
- If all points are far away from each other, each point could be covered with its own individual disc
- The central question asks whether disjoint disc coverage is always possible regardless of point configuration
Topics
Transcript
[0:00] Here's this month's new puzzle for you. Suppose you have 10 points somewhere on the two-dimensional plane and your goal is to cover them all with a set of unit discs. That is discs that have a radius of one. The one rule is that they can't overlap. They have to be disjoint. So, for example, if all 10 points were sufficiently close, you could cover them all with one disc. If all of them were far away from each other, then they could be covered each with their own disc. But the question, the puzzle for you this month is, can you always do this? Can you always find disjoint discs that cover your 10 points, no matter…
Full transcript available for MurmurCast members
Sign Up to AccessMore from 3Blue1Brown
Tie random ends: How many loops?
A math puzzle video presents a probability problem involving tying random string ends together to form loops. Starting with 50 strings and tying ends together 50 times, viewers are asked to calculate the expected number of loops. Solutions to monthly puzzles are shared on Patreon rather than in individual videos.
Escher's most mind-bending piece
An analysis of MC Escher's 1956 lithograph 'Print Gallery,' which depicts a paradoxical scene where a man views a picture that contains the very gallery he's standing in. Mathematicians in 2003 discovered the mathematical principles underlying this recursive artwork, including what should theoretically fill the mysterious blank space at the center.
The subset sum puzzle
A mathematical puzzle game is presented where one player chooses 10 numbers from 1-100, and the other must find two distinct subsets with equal sums. The challenge is to determine which player has a winning strategy.
How (and why) to take a logarithm of an image
The video explores how M.C. Escher's 1956 lithograph 'Print Gallery' can be mathematically analyzed through complex functions, specifically using logarithms to transform self-similar images into warped loops. The analysis reveals deep connections between Escher's intuitive artistic process and mathematical concepts like conformal mapping and elliptic functions.
Bacteria Grid Puzzle Solution
A puzzle about bacteria replicating on a grid that asks for the minimum moves to clear 16 lattice points is revealed to be impossible. The solution uses a clever weighting system to prove mathematically that bacteria cannot escape certain grid boundaries.