Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions (Q3318858)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3849346
Language Label Description Also known as
default for all languages
No label defined
    English
    Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
    scientific article; zbMATH DE number 3849346

      Statements

      0 references
      1984
      0 references
      prime number theorem for arithmetic progressions
      0 references
      location of zeros of Dirichlet L-functions
      0 references
      explicit numerical estimates
      0 references
      Chebyshev functions
      0 references
      Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions (English)
      0 references
      The main result of the paper deals with Chebyshev functions \(\theta(x;k,\ell)=\sum_{p\leq x,\quad p\equiv \ell(mod k)}\log p, \psi(x;k,\ell)=\sum_{p^{\alpha}\leq x,\quad p^{\alpha}\equiv \ell(mod k)}\log p,\) where the sums extend over primes p and prime powers \(p^{\alpha}\) respectively. For various values of \(\epsilon\) and b the author computs a table of explicit values of C such that the following holds: Theorem 1.2. Let k be a non-exceptional modulus, and let \((k,\ell)=1\). Then \[ | \psi(x;k,\ell)-x/\phi(k)| \leq \epsilon x/\phi(k)\quad and\quad | \theta(x;k,\ell)-x/\phi(k)| \leq \epsilon x/\phi(k), \] provided that \(k\geq 10^ b\) and \(x\geq \exp(C \log^ 2k)\).
      0 references

      Identifiers