3.7.215. Schur number

Denotes the fact that a constraint was used for solving Schur problems. Given a non -negative integer k, the Schur number S(k) is the largest integer n for which the set {1,2,...,n} can be partitioned into k sets S 1 ,S 2 ,...,S k such that i[1,k]:iS i i+iS i .