Classic problem about the limits of addition
In his 1965 paper, Erdős showed —in a proof that was just a few lines long, and hailed as brilliant by other mathematicians —that any set of N integers has a sum-free subset of at least N/3 elements.
Still, he wasn’t satisfied. His proof dealt with averages: He found a collection of sum-free subsets and calculated that their average size was N/3. But in such a collection, the biggest subsets are typically thought to be much larger than the average.
Erdős wanted to measure the size of those extra-large sum-free subsets.
Mathematicians soon hypothesized that as your set gets bigger, the biggest sum-free subsets will get much larger than N/3. In fact, the deviation will grow infinitely large. This prediction that the size of the biggest sum-free subset is N/3 plus some deviation that grows to infinity with N —is now known as the sum-free sets conjecture.
Comments
Post a Comment
Empathy recommended