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.
Summary
The video introduces a competitive mathematical puzzle involving subset sums. The game mechanics are straightforward: one player selects 10 numbers from the range 1-100, while the opponent must identify two different subsets of those numbers that produce identical sums. An example is provided showing two pairs of numbers that both sum to 102, demonstrating a winning scenario for the subset-finder. The puzzle's core question revolves around game theory - whether the number-chooser can always select a collection of 10 numbers that prevents any two subsets from having matching sums, or if the subset-finder can always guarantee finding such a pair regardless of the initial selection. This is presented as part of an ongoing monthly puzzle series created in collaboration with MoMath (Museum of Mathematics), with the solution to be revealed to subscribers at a later date.
Key Insights
- The presenter demonstrates that finding two subsets with equal sums is possible by showing two different pairs of numbers that both add up to 102
- The core puzzle question asks which player has a winning strategy - whether the number chooser can always prevent equal subset sums or the challenger can always find them
- This mathematical puzzle is part of a monthly series created in collaboration with MoMath (Museum of Mathematics)
Topics
Full transcript available for MurmurCast members
Sign Up to Access