Skip to search formSkip to main contentSkip to account menu

Generating primes

Known as: Prime number sieve, Prime sieve 
In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Os fungos micorrizicos arbusculares cumprem funcoes na ciclagem de nutrientes e na produtividade dos ecossistemas, enriquecendo o… 
2014
2014
We build a simple recursive model for the prime numbers which at its heart is the prime sieve of Eratosthenes. We also show for… 
2013
2013
Most of the cucurbits are extremely susceptible and severely infected with root-knot nematodes, Meloidogyne spp., causing immense… 
2012
2012
A sieve is constructed for ordinary twin primes of the form 6m+/-1 that are characterized by their twin rank m. It has no parity… 
2011
2011
We present a new sieving technique designed to recover microfossils from mudstones, clays and poorly consolidated sediments. This… 
2011
2011
Mgbeahurike . A. C. Faecal characteristics and production of dairy cows in early lactation. Master of Science Thesis. No. 62 ISSN… 
2010
2010
A prime number sieve is an algorithm for finding all prime numbers in the range [2,n]. For large n, however, the actual run time… 
2003
2003
A transformation of multi-valued input binary-output functions, called co-singleton transform (CST), was introduced in [11] to… 
1988
1988
Six Zebu-cross steers were fed Rhodes grass (Chloris gayana) hay plus urea and minif% r s ad libitum each 12 hours. Organic… 
1985
1985
SummaryIt has been found that the lignin in a middle lamella fraction isolated by a sieving technique has the same reactivity to…