22,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
11 °P sammeln
Andere Kunden interessierten sich auch für
![Probability Density Function]( "Probability Density Function")
Probability Density Function19,99 €![Spectral Density Estimation]( "Spectral Density Estimation")
Spectral Density Estimation22,99 €![Probability Density Function]( "Probability Density Function")
Probability Density Function22,99 €![Polygon Semi regular Low Density Parity Check Codes]( "Polygon Semi regular Low Density Parity Check Codes")
Polygon Semi regular Low Density Parity Check Codes32,99 €![Density Functional Theory]( "Density Functional Theory")
Density Functional Theory160,49 €![Population Density Approach to Neural Network Modeling]( "Population Density Approach to Neural Network Modeling")
Population Density Approach to Neural Network Modeling38,99 €![Robust Spectral Density Estimation]( "Robust Spectral Density Estimation")
Robust Spectral Density Estimation69,90 €
High Quality Content by WIKIPEDIA articles! In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician L.G. Schnirelmann, who was the first to study it.In 1931 Schnirelmann used these ideas in conjunction with the Brun sieve to prove Schnirelmann's theorem, that any natural number can be written as the sum of not more than C prime numbers, where C is an effectively computable constant. Schnirelmann's constant is the lowest number C with this property.Olivier Ramaré showed in (Ramaré 1995) that Schnirelmann's constant is at most 7, improving the earlier upper bound 19 by Hans Riesel and R. C. Vaughan.Schnirelmann's constant is at least 3; Goldbach's conjecture implies that this is the constant's actual value.