A result in Ramsey Theory, the theorem states that however the positive integers are each assigned with one of r colours, there are arbitrarily long arithmetic progressions that are monochrome. The least number W(r,k) by which point a monochrome progression of length k is guaranteed to occur is very difficult to compute in general. See Szemerédi’s theorem.