Name
Abstract | ||
|---|---|---|
We explain how the Meissel- Lehmer- Lagarias- Miller- Odlyzko method for computing pi( x) can be used for computing efficiently pi(x; k; l), the number of primes congruent to l modulo k up to x. As an application, we computed the number of prime numbers of the form 4n +/- 1 less than x for several values of x up to 10(20) and found a new region where pi( x; 4; 3) is less than pi( x; 4; 1) near x = 10(18). |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1090/S0025-5718-04-01649-7 | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
prime numbers,residue classes,Chebyshev's bias | Integer,Combinatorics,Quadratic residue,Prime number,Algebra,Modulo,Mathematical analysis,Prime k-tuple,Congruence (geometry),Coprime integers,Mathematics,Chebyshev's bias | Journal |
Volume | Issue | ISSN |
73 | 247 | 0025-5718 |
Citations | PageRank | References |
1 | 0.38 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Deléglise | 1 | 8 | 5.25 |
| Pierre Dusart | 2 | 151 | 10.87 |
| Xavier-François Roblot | 3 | 12 | 4.71 |