--- title: The subset sum puzzle | daily.dev description: 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... canonical: https://daily.dev/posts/the-subset-sum-puzzle-grtxgnmev twitter:card: summary_large_image twitter:site: @dailydotdev og:type: website og:site_name: daily.dev og:title: The subset sum puzzle | daily.dev og:description: 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... og:url: https://daily.dev/posts/the-subset-sum-puzzle-grtxgnmev og:image: https://api.daily.dev/og/posts/grtXGnMeV.png og:image:alt: The subset sum puzzle og:image:width: 1200 og:image:height: 630 og:locale: en --- > ## Documentation Index > Fetch the complete documentation index at: https://daily.dev/llms.txt > Use this file to discover all available pages before exploring further. # The subset sum puzzle **[3Blue1Brown](https://daily.dev/sources/3blue1brown)** · 1 min read · 1 upvotes · 0 comments ## Summary 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. ## Full article daily.dev links to this article rather than hosting it. Read it at the original source: ## Similar posts on daily.dev - [Erdős Problem \#124](https://daily.dev/posts/erd-s-problem-124-5h47gaso9) · Hacker News · 1 upvotes · 0 comments - [The Subset Sum Problem Solved in Linear Time for Dense Enough Inputs](https://daily.dev/posts/the-subset-sum-problem-solved-in-linear-time-for-dense-enough-inputs-sjlhgprsn) · Towards Data Science · 0 upvotes · 0 comments - [3 Sum Problem in DSA \(Example and Optimized Solution\)](https://daily.dev/posts/3-sum-problem-in-dsa-example-and-optimized-solution--67wpded8f) · C\# Corner · 0 upvotes · 0 comments --- Tags: [#math](https://daily.dev/tags/math) [View this post on daily.dev](https://daily.dev/posts/the-subset-sum-puzzle-grtxgnmev) ```json {"@context":"https://schema.org","@graph":[{"@type":"Organization","@id":"https://daily.dev/#organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180},"sameAs":["https://twitter.com/dailydotdev","https://github.com/dailydotdev","https://www.linkedin.com/company/daily-dev-ltd"]},{"@type":"WebSite","@id":"https://daily.dev/#website","url":"https://daily.dev","name":"daily.dev","publisher":{"@id":"https://daily.dev/#organization"},"potentialAction":{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https://daily.dev/search?q={search_term_string}"},"query-input":"required name=search_term_string"}}]} {"@context":"https://schema.org","@type":"TechArticle","headline":"The subset sum puzzle","url":"https://daily.dev/posts/the-subset-sum-puzzle-grtxgnmev","mainEntityOfPage":{"@type":"WebPage","@id":"https://daily.dev/posts/the-subset-sum-puzzle-grtxgnmev"},"datePublished":"2026-03-25T21:10:16.121Z","dateModified":"2026-03-25T21:10:30.663Z","description":"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...","image":"https://i.ytimg.com/vi/4h5BEALuh44/sddefault.jpg","thumbnailUrl":"https://i.ytimg.com/vi/4h5BEALuh44/sddefault.jpg","isAccessibleForFree":true,"articleSection":"3Blue1Brown","inLanguage":"en","publisher":{"@type":"Organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180}},"author":{"@type":"Organization","name":"3Blue1Brown","logo":"https://media.daily.dev/image/upload/s--rovuuMEM--/f_auto/v1713542252/logos/3blue1brown","url":"https://daily.dev/sources/3blue1brown"},"commentCount":0,"discussionUrl":"https://daily.dev/posts/the-subset-sum-puzzle-grtxgnmev","interactionStatistic":[{"@type":"InteractionCounter","interactionType":{"@type":"LikeAction"},"userInteractionCount":1},{"@type":"InteractionCounter","interactionType":{"@type":"CommentAction"},"userInteractionCount":0}],"keywords":"math","timeRequired":"PT1M","video":{"@type":"VideoObject","name":"The subset sum puzzle","description":"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...","thumbnailUrl":"https://i.ytimg.com/vi/4h5BEALuh44/sddefault.jpg","uploadDate":"2026-03-25T21:10:16.121Z","duration":"PT1M","url":"https://api.daily.dev/r/grtXGnMeV","embedUrl":"https://www.youtube.com/embed/4h5BEALuh44"}} {"@context":"https://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https://daily.dev"},{"@type":"ListItem","position":2,"name":"3Blue1Brown","item":"https://daily.dev/sources/3blue1brown"},{"@type":"ListItem","position":3,"name":"The subset sum puzzle"}]} ```