Student Solves a Long-Standing Problem About the Limits of Addition

Original version Of This is the story Present How many magazinesThe

Simple ideas in mathematics can also be the most confusing.

Add. This is a straight operation: One of the first mathematical truths we learn is one of the 1 plus 1 equals 2. However, there are still many answer questions about the types of mathematicians that can give birth to the type. “This is an early job you can do,” Benjamin BedartA graduate student at the University of Oxford. “Somehow, it’s still very mysterious in many ways” “

In this mystery investigation, mathematicians also expect to understand the power limit of addition. In the early twentieth century, they are studying the nature of “sum-free” sets — the number of seats where no two numbers will be added to the third. For example, add any two odd numbers and you will get an even number. The set of odd numbers is so free.

In a research paper of 1965, the conventional mathematician Paul Erds asked a simple question about how the general sum-free sets were. However, for decades, the progress of the problem was negligible.

“This is a very basic-sounding thing that we had very little understanding to us,” said JulianA mathematician at the University of Cambridge.

This is until February. Sixty years after Erdos raised his problem, Bedart solved it. He showed that on any set of integers – positive and negative count numbers – there A large subset of numbers that must be free -freeThe His evidence has reached the depth of mathematics, not just in collective-free sets, but also in other types of other settings to reveal strategies from separate fields to uncover the hidden structure.

“This is a great achievement,” said co -operation.

Stuck in the middle

Erds knew that any set of an integer must have a small, yoga-free subset. Consider the set {1, 2, 3}, which is not united. It has five separate yoga -free subsets, such as {1} and {2, 3}}

Erds wanted to know how far this incident had expanded. If you have a set with a million integer, how big is its largest sum-free subset?

In many cases it is huge. If you chose randomly a million integer, they will be odd, they will give you a yoga -free subsett with about 500,000 elements.

In his research paper of 66565, Erdos showed – a proof that was only a few lines long and admired by other mathematicians as bright by – any set N The integer contains at least one yoga -free subset N/3 elements.

Yet, he was not satisfied. His evidence has dealt with average: he found a collection of collective-free subsets and calculated that their average size was N/3. However, in this national collection, the largest subsets are usually considered much larger than average.

Erds wanted to measure the size of those extra-yard-free subsets.

Mathematicians soon assumed that the largest yoga free subsets would be much larger than your set was bigger N/3. In fact, the deviation will be infinitely larger. The size N/3 plus some deviations with which the eternal grows with N— Now known as the sum-free set estimate.