A variant of the Bombieri-Vinogradov theorem with explicit constants and applications
From MaRDI portal
Publication:5246847
DOI10.1090/S0025-5718-2014-02919-0zbMath1341.11053arXiv1309.2730OpenAlexW2015967265MaRDI QIDQ5246847
Publication date: 22 April 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2730
Related Items (5)
A logarithmic improvement in the Bombieri-Vinogradov theorem ⋮ The distribution of sums and products of additive functions ⋮ An analog of perfect numbers involving the unitary totient function ⋮ THE DISTRIBUTION OF THE NUMBER OF SUBGROUPS OF THE MULTIPLICATIVE GROUP ⋮ Medium-sized values for the prime number theorem for primes in arithmetic progressions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primality testing with Gaussian periods
- Approximate formulas for some functions of prime numbers
- Remarks on the Pólya–Vinogradov Inequality
- An elementary method in prime number theory
- Sur une somme liée à la fonction de Möbius.
- The large sieve
- The analytic principle of the large sieve
- Shifted primes without large prime factors
- Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
- On the greatest prime factor of $p-1$ with effective constants
- On the large sieve
- On the number of primes p for which p+a has a large prime factor
- A note on the least prime in an arithmetic progression with a prime difference
- On the Number of Solutions of the Equation P = a +n 1 …nk with a = p ⩾ x
- On the Number of Solutions of the Equation P +n 1 ..n k = N
This page was built for publication: A variant of the Bombieri-Vinogradov theorem with explicit constants and applications
