Schur's problem concerns the least interval length forcing a monochromatic solution to under every coloring with a fixed
number of colors. Schur (1916) proved that no matter how the set of positive
integers less than or equal to
(where
is the floor function)
is partitioned into
classes, one class must contain integers
,
,
such that
, where
and
are not necessarily distinct. The least integer
with this property is
, where
is the Schur number. The
upper bound has since been slightly improved to
.
Schur's Problem
See also
Combinatorics, Ramsey Number, Schur Number, Schur's Partition Theorem, Sum-Free SetExplore with Wolfram|Alpha
References
Abbott, H. L. and Hanson, D. "A Problem of Schur and Its Generalizations." Acta Arith. 20, 175-187, 1972.Abbott, H. L. and Moser, L. "Sum-Free Sets of Integers." Acta Arith. 11, 393-396, 1966.Beutelspacher, A. and Brestovansky, W. "Generalized Schur Numbers." In Combinatorial Theory: Proceedings of a Conference Held at Schloss Rauischholzhausen, May 6-9, 1982 (Ed. D. Jungnickel and K. Vedder). Berlin, Germany: Springer-Verlag, pp. 30-38, 1982.Choi, S. L. G. "The Largest Sum-Free Subsequence from a Sequence ofReferenced on Wolfram|Alpha
Schur's ProblemCite this as:
Weisstein, Eric W. "Schur's Problem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SchursProblem.html