Primes in arithmetic progressions

From MaRDI portal
Publication:4878560


DOI10.1090/S0025-5718-96-00669-2zbMath0856.11042MaRDI QIDQ4878560

Olivier Ramaré, Robert S. Rumely

Publication date: 18 June 1996

Published in: Mathematics of Computation (Search for Journal in Brave)


11M26: Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses

11N13: Primes in congruence classes

11-04: Software, source code, etc. for problems pertaining to number theory

11Y35: Analytic computations


Related Items

Chebyshev’s bias for composite numbers with restricted prime divisors, The hexagonal versus the square lattice, Estimates of $\theta(x;k,l)$ for large values of $x$, Unnamed Item, New bounds for $\psi (x)$, Explicit upper bounds for the remainder term in the divisor problem, Updating the error term in the prime number theorem, Parity of the coefficients of modular forms, Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree, Weighted spectral large sieve inequalities for Hecke congruence subgroups of \(\mathrm{SL}(2,\mathbb{Z}[i)\)], On the products \((1^\ell + 1)(2^\ell + 1)\cdots(n^\ell + 1)\). II, Regular graphs of large girth and arbitrary degree, Irreducibility of generalized Hermite-Laguerre polynomials, Irreducibility of some orthogonal polynomials, Hecke eigenvalues of Siegel modular forms of ``different weights, The Nicolas and Robin inequalities with sums of two squares, The least modulus for which consecutive polynomial values are distinct, The Diophantine equation \((x^{k} - 1)(y^{k} - 1) = (z^{k} - 1)^{t}\), Irreducibility of generalized Hermite-Laguerre polynomials. II., Solving norm form equations via lattice basis reduction, On the number of unitary divisors of integers in arithmetic progressions, The number of divisors of an integer in arithmetic progressions, On functions taking only prime values, On the Galois groups of Legendre polynomials, An explicit result of the sum of seven cubes, Number of prime divisors in a product of terms of an arithmetic progression, Rational approximations to \(\root 3\of 2\) and other algebraic numbers revisited, Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis, Every odd number greater than $1$ is the sum of at most five primes, Sieve methods for odd perfect numbers, Squares in blocks from an arithmetic progression and Galois group of Laguerre polynomials, Starting with gaps between k-free numbers, SOLVING n(n + d) ⋯ (n + (k - 1)d) = by2WITH P(b) ≤ Ck, On (Not) Computing the Möbius Function Using Bounded Depth Circuits, VALEURS IMPAIRES DE LA FONCTION DE PARTITION p(n), On the sum of the square of a prime and a square-free number, Generalized Euler constants, Short effective intervals containing primes in arithmetic progressions and the seven cubes problem, On the factorization of consecutive integers, Simple families of Thue inequalities, On sums of seven cubes



Cites Work