Szemerédi's theorem
Long dense subsets of the integers contain arbitrarily large arithmetic progressions / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Szemerédi's theorem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured[1] that every set of integers A with positive natural density contains a k-term arithmetic progression for every k. Endre Szemerédi proved the conjecture in 1975.