The Subset Sum Puzzle: Who Has a Winning Strategy?

Choose ten integers from 1 to 100, then look for two different subsets with the same sum.

채널
3Blue1Brown
게시일
2026년 3월 25일
영상
0:48
읽기
1분
원문
영어
YouTube에서 열기
스크롤하면 영상이 오른쪽 아래로 작아져 계속 재생됩니다. 자막은 읽기 언어를 따릅니다.
읽기 언어2개 언어로 읽을 수 있음
이 글은 아직 한국어 번역이 없어 영어 원문으로 표시합니다.
요약

30초 요약

3Blue1Brown and MoMath pose a game about equal subset sums and ask which player can guarantee a win.

  1. 1The player’s taskFind two different subsets with the same sum.
  2. 2The chooser’s taskFind ten numbers with no equal-sum pair of distinct subsets.
  3. 3An open challengeThe short video leaves the solution for a later installment.

핵심 정리

  1. Ten distinct integers are chosen from 1 through 100.
  2. One player seeks two distinct subsets with equal sums; the other seeks a selection that makes that impossible.
  3. The short video poses the puzzle without presenting the solution.
전문

챕터별로 다듬은 전문 읽기

원본 자막만 보기
01

The rules

Choose ten numbers and compare sums of subsets.

Imagine a game played with the integers from 1 through 100. I choose ten distinct numbers and show them to you.

Your task is to find two distinct subsets of those ten numbers whose sums are equal. For example, two different pairs might both add up to 102. If you find such a pair of subsets, you win.

02

Who can force a win?

Decide whether the chooser can prevent an equal-sum pair.

I win if I can choose ten numbers for which no two different subsets have the same sum. The puzzle is to determine which player has a winning strategy.

This is a monthly puzzler made with MoMath. The short video poses the question and leaves the solution for a later installment.

같은 채널의 다른 글

슬라이드 20장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.MathematicsAI for scienceHuman-AI Collaboration+2
슬라이드 29장51:55EN
3Blue1Brown· 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.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 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.MathematicsEducation
슬라이드2:25EN
3Blue1Brown· 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.MathematicsAI History
슬라이드 4장32:19EN
3Blue1Brown· 2026년 6월 7일Reinventing Entropy: Why Prediction Helps Compress LanguageA robot’s movement code leads from prefix-free encoding to Shannon information and the entropy of language.MathematicsScience Communication
슬라이드 4장44:52EN
3Blue1Brown· 2026년 3월 22일How a Complex Logarithm Turns Escher’s Zoom into a LoopA visual journey from the Droste effect and conformal maps to the spiraling center of Escher’s Print Gallery.MathematicsScience Communication