Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.