English

Accurate Computations of Euler Products over Primes in Arithmetic Progressions

Number Theory 2019-11-26 v1

Abstract

This note provides truncated formulae with explicit error terms to compute Euler products over primes in arithmetic progressions of rational fractions. It further provides such a formula for the product of terms of the shape F(1/p,1/ps)F(1/p, 1/p^s) when FF is a two-variable polynomial with coefficients in C\mathbb{C} and satisfying some restrictive conditions.

Keywords

Cite

@article{arxiv.1911.10991,
  title  = {Accurate Computations of Euler Products over Primes in Arithmetic Progressions},
  author = {Olivier Ramaré},
  journal= {arXiv preprint arXiv:1911.10991},
  year   = {2019}
}

Comments

10 pages

R2 v1 2026-06-23T12:26:31.902Z