Explore: Sieves (mathematics)

; Ulam, S. (1956). "On certain sequences of integers defined by sieves". Mathematics Magazine. 29 (3): 117–122. doi:10.2307/3029719. ISSN 0025-570X. JSTOR 3029719

field sieve Large sieve Quadratic sieve Sieve of Atkin Sieve of Eratosthenes Sieve of Sundaram Sieve of Pritchard Sieve, in medicine, a "surgical sieve" refers

In mathematics, the Legendre sieve, named after Adrien-Marie Legendre, is the simplest method in modern sieve theory. It applies the concept of the Sieve

mathematician, though describing the sieving by odd numbers instead of by primes. One of a number of prime number sieves, it is one of the most efficient

small sieves such as the Selberg sieve wherein only a few residue classes are removed. The method has been further heightened by the larger sieve which

Sieve method, or the method of sieves, can mean: in mathematics and computer science, the sieve of Eratosthenes, a simple method for finding prime numbers

Modern sieves include the Brun sieve, the Selberg sieve, the Turán sieve, the large sieve, the larger sieve and the Goldston–Pintz–Yıldırım sieve. One of

topology. In a Grothendieck topology, certain sieves become categorical analogues of open covers in topology. Sieves were introduced by Giraud (1964) in order

In mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes

number theory, the parity problem refers to a limitation in sieve theory that prevents sieves from giving good estimates in many kinds of prime-counting