A mathematical puzzle about subset sums: given 10 numbers chosen from 1 to 100, can you always find two distinct subsets with the same sum, or can the chooser pick numbers to prevent this? The puzzle asks which player has the winning strategy, with the solution to be revealed later as part of a monthly MoMath collaboration series.
•1m watch time
Sort: