30초 요약
Two people divide a necklace so each receives half of every jewel type. The short illustrates a four-type example and states that n types can be split fairly with at most n cuts, without presenting the full proof.
- 1The necklaceFour types of jewels appear in an arbitrary order.
- 2A fair splitSegments are assigned so each person receives half of each type.
- 3The general claimFor n types, at most n cuts suffice when each type has an even count.
핵심 정리
- Each jewel type has an even count and must be split equally.
- The example divides four types with four cuts.
- The general n-cut statement is a claim whose proof appears in the full video.
챕터별로 다듬은 전문 읽기
A fair-division puzzle
An example and a general claim introduce necklace splitting.
The narrator presents a necklace with four types of jewels in an arbitrary order: eight sapphires, ten emeralds, four diamonds and six rubies. Two people want each to receive half of every type.
The challenge is to cut the necklace into segments using as few cuts as possible, then assign each segment to one of the two people. In the example, four cuts produce a division where each receives four sapphires, five emeralds, two diamonds and three rubies.
The short states the general claim: for n jewel types with an even number of each, a fair division can be made with at most n cuts. It introduces the puzzle but does not include the topological proof; the linked full video develops that argument.
같은 채널의 다른 글
40:44EN
3Blue1Brown· 2026년 10월 16일Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.
51:55EN3Blue1Brown· 2026년 9월 18일The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.
0:55EN3Blue1Brown· 2026년 7월 24일The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.
33:51EN3Blue1Brown· 2026년 7월 16일What Cross-Entropy Connects: Compression, Language Models and KL DivergenceGrant Sanderson · 3Blue1BrownGrant Sanderson builds cross-entropy from code lengths and uses it to explain next-token training and distillation.
2:25EN3Blue1Brown· 2026년 6월 12일How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.
1:02EN3Blue1Brown· 2026년 6월 10일A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?