Common
Szemerédi's theorem
Long dense subsets of the integers contain arbitrarily large arithmetic progressions
Long dense subsets of the integers contain arbitrarily large arithmetic progressions
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 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.
Open boosters, collect cards and trade them. Free to play.
Play for free