Andere Kunden interessierten sich auch für
![Sieve (Category Theory)]( "Sieve (Category Theory)")
Sieve (Category Theory)22,99 €![Parity Problem (Sieve Theory)]( "Parity Problem (Sieve Theory)")
Parity Problem (Sieve Theory)25,99 €![Quadratic Sieve]( "Quadratic Sieve")
Quadratic Sieve22,99 €![Special Number Field Sieve]( "Special Number Field Sieve")
Special Number Field Sieve25,99 €![Turán Sieve]( "Turán Sieve")
Turán Sieve22,99 €![Sieve of Sundaram]( "Sieve of Sundaram")
Sieve of Sundaram22,99 €![Sieve of Atkin]( "Sieve of Atkin")
Sieve of Atkin22,99 €
High Quality Content by WIKIPEDIA articles! Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The primordial example of a sifted set is the set of prime numbers up to some prescribed limit X. Correspondingly, the primordial example of a sieve is the sieve of Eratosthenes, or the more general Legendre sieve. The direct attack on prime numbers using these methods soon reaches apparently insuperable obstacles, in the way of the accumulation of error terms. In one of the major strands of number theory in the twentieth century, ways were found of avoiding some of the difficulties of a frontal attack with a naive idea of what sieving should be. One successful approach is to approximate a specific sifted set of numbers (e.g. the set of prime numbers) by another, simpler set (e.g. the set of almost prime numbers), which is typically somewhat larger than the original set, and easier to analyze.