Richard P. Brent, The rst occurrence of large gaps between successive primes, Math. Comp. 27 (1973), 959-963. MR 48#8360. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Prime Sieves Using Binary Quadratic Forms - Atkin, Bernstein (1999) (1 citation) (Correct)
....seconds to nd the 50847534 primes up to 1000000000. Here B = 128128; the UltraSPARC has 131072 bits of fast memory. Notes. Singleton in [13] suggested chopping a large interval into small pieces and applying the sieve of Eratosthenes to each piece. The same idea was published independently in [3] and later in [2] Sieving an arithmetic progression is the p adic analogue of sieving a bounded interval. Presumably Eratosthenes did not bother writing down even numbers in his sieve. Instead of running Algorithm 2.1 independently for each d, one can handle all d simultaneously for each q: nd ....
Richard P. Brent, The rst occurrence of large gaps between successive primes, Mathematics of Computation 27 (1973), 959-963.
New Prime Gaps Between 10^15 and 5 × 10^16 - Nyman, Nicely (2003) (Correct)
No context found.
Richard P. Brent, The rst occurrence of large gaps between successive primes, Math. Comp. 27 (1973), 959-963. MR 48#8360.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC