On prime numbers in an arithmetic progression with a prime-power difference
From MaRDI portal
Publication:5334382
DOI10.4064/AA-9-4-375-390zbMATH Open0127.26901OpenAlexW336002050MaRDI QIDQ5334382FDOQ5334382
Authors: M. B. Barban, Yu. V. Linnik, N. G. Chudakov 
Publication date: 1964
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/207492
Cited In (17)
- Computing Dirichlet character sums to a power-full modulus
- Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
- A bound for the representability of large numbers by ternary quadratic forms and nonhomogeneous Waring equations
- On the maximal exponent of the prime power divisor of integers
- A Bombieri–Vinogradov-type theorem with prime power moduli
- The Weyl bound for Dirichlet \(L\)-functions of cube-free conductor
- Primes in progressions to prime-power modulus
- Weyl-type bounds for twisted \(\mathrm{GL}(2)\) short character sums
- Burgess bounds for short character sums evaluated at forms
- Infiniteness sets of primes, admitting diophantine representations in eight variables
- \({\mathfrak M}\)-additive functions. I
- An explicit hybrid estimate for \(L(1/2+it,\chi)\)
- Distribution of digits of primes in \(q\)-ary canonical form
- Primes in progressions to moduli with a large power factor
- Regular sets in residue classes
- Randomized algorithms over finite fields for the exact parity base problem.
- A note on character sums
This page was built for publication: On prime numbers in an arithmetic progression with a prime-power difference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5334382)
