{"id":15726,"date":"2025-06-29T13:50:48","date_gmt":"2025-06-29T13:50:48","guid":{"rendered":"https:\/\/topat10.com\/?p=15726"},"modified":"2025-06-29T13:50:48","modified_gmt":"2025-06-29T13:50:48","slug":"student-solves-a-long-standing-problem-about-the-limits-of-addition","status":"publish","type":"post","link":"https:\/\/topat10.com\/?p=15726","title":{"rendered":"Student Solves a Long-Standing Problem About the Limits of Addition"},"content":{"rendered":"


\n<\/p>\n

\n

The original version<\/span> of<\/em> this story<\/em><\/a> appeared in Quanta Magazine<\/a>.<\/em><\/p>\n

The simplest ideas in mathematics can also be the most perplexing.<\/p>\n

Take addition. It\u2019s a straightforward operation: One of the first mathematical truths we learn is that 1 plus 1 equals 2. But mathematicians still have many unanswered questions about the kinds of patterns that addition can give rise to. \u201cThis is one of the most basic things you can do,\u201d said Benjamin Bedert<\/a>, a graduate student at the University of Oxford. \u201cSomehow, it\u2019s still very mysterious in a lot of ways.\u201d<\/p>\n

In probing this mystery, mathematicians also hope to understand the limits of addition\u2019s power. Since the early 20th century, they\u2019ve been studying the nature of \u201csum-free\u201d sets\u2014sets of numbers in which no two numbers in the set will add to a third. For instance, add any two odd numbers and you\u2019ll get an even number. The set of odd numbers is therefore sum-free.<\/p>\n

In a 1965 paper, the prolific mathematician Paul Erd\u0151s asked a simple question about how common sum-free sets are. But for decades, progress on the problem was negligible.<\/p>\n

\u201cIt\u2019s a very basic-sounding thing that we had shockingly little understanding of,\u201d said Julian Sahasrabudhe<\/a>, a mathematician at the University of Cambridge.<\/p>\n

Until this February. Sixty years after Erd\u0151s posed his problem, Bedert solved it. He showed that in any set composed of integers\u2014the positive and negative counting numbers\u2014there\u2019s a large subset of numbers that must be sum-free<\/a>. His proof reaches into the depths of mathematics, honing techniques from disparate fields to uncover hidden structure not just in sum-free sets, but in all sorts of other settings.<\/p>\n

\u201cIt\u2019s a fantastic achievement,\u201d Sahasrabudhe said.<\/p>\n

Stuck in the Middle<\/h2>\n

Erd\u0151s knew that any set of integers must contain a smaller, sum-free subset. Consider the set {1, 2, 3}, which is not sum-free. It contains five different sum-free subsets, such as {1} and {2, 3}.<\/p>\n

Erd\u0151s wanted to know just how far this phenomenon extends. If you have a set with a million integers, how big is its biggest sum-free subset?<\/p>\n

In many cases, it\u2019s huge. If you choose a million integers at random, around half of them will be odd, giving you a sum-free subset with about 500,000 elements.<\/p>\n

\n
\n