Weak Schur numbers
For each number of colours k, what is the largest N such that 1, 2, ..., N can be coloured with k colours with no colour holding distinct x, y and x + y?
Summary
The weak Schur number WS(k) is the largest N for which the integers 1 to N can be split into k weakly sum-free sets: no set holds x, y and x + y with x and y different. Exact values are known only for small k; beyond them there are lower bounds from explicit colourings and much larger upper bounds.
Source
Open, as listed by Leaps in Bounds, weak Schur numbers · Leaps in Bounds. Checked 19 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.