# Schnirelmann's constant

In 1930 Schnirelmann proved that there exists a positive integer *s* such that every sufficiently large integer is the sum of at most *s* primes.
It follows then that there is a constant, called the **Schnirelmann constant**,
*s*_{o}
so that all integers greater than one are the sum of at most *s*_{o} primes.

In 1959 Schinzel showed that Goldbach's conjecture is equivalent to the statement that every even integer greater than 17 is the sum of three distinct primes. This means that most likely *s*_{o} = 3. But what has been proved?

From Schnirelmann's work it was known *s*_{o} is less than 800,000. By 1976 Klimov had reduced this to 55 and Vaughan to 27. In 1983 Riesel and Vaughan reduced it further to 19 and finally in 1995, Ramare showed *s*_{o} is at most 6. In 2014, Terrence Tao reduced this to 5.

Vinogradov showed that all sufficiently large integers are the sum of at most 4 primes, but even using Chen and Wang's effective bounds "sufficiently large" is larger than 10^{43000}. Way too large for a brute force attack on this problem.

**Related pages** (outside of this work)

- Mathworld's Schnirelmann's Theorem

**References:**

- Ramare95
O. Ramaré, "On Schnirelmann's constant,"Ann. Sc. Norm. Super. Pisa,22:4 (1995) 645-706.MR 97a:11167- Ribenboim95 (293--296)
P. Ribenboim,The new book of prime number records, 3rd edition, Springer-Verlag, New York, NY, 1995. pp. xxiv+541, ISBN 0-387-94457-5.MR 96k:11112[An excellent resource for those with some college mathematics. Basically a Guinness Book of World Records for primes with much of the relevant mathematics. The extensive bibliography is seventy-five pages.]- Tao2014
Tao, Terence, "Every odd number greater than 1 is the sum of at most five primes,"Math. Comp.,83:286 (2014) 997--1038. (https://doi.org/10.1090/S0025-5718-2013-02733-0)MR 3143702(Abstract available)