Papex

Open problem · Mathematics · Open

Schur numbers

For k colours, what is the largest N such that the whole numbers 1, ..., N can be coloured so that no colour contains numbers x, y and x + y (x = y allowed)?

Summary

The Schur number S(k) is the largest N for which 1, ..., N can be split into k sum-free sets, x = y allowed. Only S(1) to S(5) are known: 1, 4, 13, 44, 160 (OEIS A045652). The problem is also listed as no. 483 in the Erdős problem database, which asks how f(k) = S(k) + 1 grows: is f(k) < c^k for some constant c?

Source

Open, as listed by OEIS A045652, Schur's numbers (version 2) · OEIS. Checked 20 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.

More in Mathematics