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.

Chaîne
3Blue1Brown
Publié
25 mars 2026
Vidéo
0:48
Lecture
1 min
Original
anglais
Ouvrir sur YouTube
En faisant défiler, la vidéo se réduit en bas à droite et continue. Les sous-titres suivent votre langue de lecture.
Langue de lectureDisponible en 2 langues
Cet article n’est pas encore disponible en français ; il s’affiche dans l’original en anglais.
RÉSUMÉ

En 30 secondes

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.

À retenir

  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.
TEXTE INTÉGRAL

Lire le texte remanié, chapitre par chapitre

Transcription seule
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.

Sur la même chaîne

20 diapositives40:44EN
3Blue1Brown· 16 oct. 2026Grant 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 diapositives51:55EN
3Blue1Brown· 18 sept. 2026The 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· 24 juil. 2026The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
Diapositives2:25EN
3Blue1Brown· 12 juin 2026How 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
Diapositives1:02EN
3Blue1Brown· 10 juin 2026A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?MathematicsScience Communication
4 diapositives32:19EN
3Blue1Brown· 7 juin 2026Reinventing 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