Tag Archives: Arithmetic progressions

Pushing Behrend Around

Erdos and Turan asked in 1936: What is the largest subset of {1,2,…,n} without a 3-term arithmetic progression? In 1946 Behrend found an example with  Now, sixty years later, Michael Elkin pushed the the factor from the denominator to the enumerator, … Continue reading

Posted in Combinatorics, Updates | Tagged , , | 10 Comments