KnowraSchur's theoremLinked fromLinked fromThe 11 pages that link to Schur's theorem, each with the reason it gives.All 11Related 6Compared with 5Ramsey's theoremCompared with: It exemplifies a coloring theorem that forces a specific algebraic pattern.Van der Waerden's theoremCompared with: It forces one additive equation, whereas Van der Waerden guarantees progressions of every finite length.Bunyakovsky conjectureCompared with: It proves infinitely many prime divisors, a weaker conclusion than infinitely many prime values.Zsigmondy's theoremCompared with: Schur guarantees infinitely many primes across polynomial values, rather than a new divisor at each exponent.Schinzel's theoremCompared with: Schur guarantees prime divisors of values, while Schinzel guarantees prime moduli with roots.