2000 character limit reached
Accurate Computations of Euler Products over Primes in Arithmetic Progressions
Published 25 Nov 2019 in math.NT | (1911.10991v1)
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)$ when $F$ is a two-variable polynomial with coefficients in $\mathbb{C}$ and satisfying some restrictive conditions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.