Hi everybody!
I remember someone mentioned link to a wikipedia page in the editorial of DEVGOSTR. But I am unable to find it. I want to know why for length>26 there are no good strings?
I think it was for A=3…there were no good strings of length>26…
And you might be referring to this page…
Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive integers r and k, there is some number N such that if the integers {1, 2, ..., N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression whose elements are of the same color. The least such N is the Van der Waerden number W(r, k), named after the Dutch mathematician B. L. van der Waerden.
Fo...
Hope it helps
1 Like
