Schur's Lemma

For each there exists a largest Integer (known as the Schur Number) such that no matterhow the set of Integers less than (where is the Floor Function) ispartitioned into classes, one class must contain Integers , , such that , where and are not necessarily distinct. The upper bound has since been slightly improved to .

References

Guy, R. K. ``Schur's Problem. Partitioning Integers into Sum-Free Classes'' and ``The Modular Version of Schur's Problem.'' §E11 and E12 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 209-212, 1994.

• Liouville Measure
• Liouville Number
• Liouville Polynomial Identity
• Liouville-Roth Constant
• Liouville's Boundedness Theorem
• Liouville's Conformality Theorem
• Liouville's Conic Theorem
• Liouville's Constant
• Liouville's Elliptic Function Theorem
• Liouville Space
• Liouville's Phase Space Theorem
• Liouville's Rational Approximation Theorem
• Liouville's Sphere-Preserving Theorem
• Lipschitz Condition
• Lipschitz Function
• Lipschitz's Integral
• Lissajous Curve
• Lissajous Figure
• List
• Lituus
• Lituus Inverse Curve
• LLL Algorithm
• Ln
• Lobachevsky-Bolyai-Gauss Geometry
• Lobachevsky's Formula