Accurate computations of Euler products over primes in arithmetic progressions

DOI10.7169/FACM/1853MaRDI QIDQ2075008zbMATH OpenOpenAlexFDO

Authors Olivier Ramaré

Publication date 11 February 2022

Published in Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.10991

zbMATH Keywords

Euler productsprimes in arithmetic progressionrational fractions

Mathematics Subject Classification ID

Primes in congruence classes (11N13) Evaluation of number-theoretic constants (11Y60)

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/p^s)$ when $F$ is a two-variable polynomial with coefficients in $mathbbC$ and satisfying some restrictive conditions.

Review text

In the paper under review, the author establishes accurate truncated formulae to compute Euler products over primes in arithmetic progressions of rational fractions, providing explicit error terms in the corresponding formulae. The author also presents such a formula for the product of terms of the form \(F\left(\frac{1}{p}, \frac{1}{p^s}\right)\) when \(F\) is a two-variable polynomial with coefficients in the set of complex numbers and satisfying some restrictive conditions. The paper is very well written and well motivated, providing some very interesting results. It is a valuable contribution to the domain of number theory.

Recommendations

• Fast multi-precision computation of some Euler products
• scientific article; zbMATH DE number 819075
• Mean values of finite Euler products
• On Euler products with smaller than one exponents
• On a generalization of the Euler totient function

Cites work

• Approximation of singular series and automata
• Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
• Extension of Estermann's theorem to Euler products associated to a multivariate polynomial
• Fast multi-precision computation of some Euler products
• Lal's Constant and Generalizations
• Mertens' theorem for arithmetic progressions
• On Numbers of the Form n 4 + 1
• On the analytic continuation of Eulerian products
• On the Conjecture of Hardy & Littlewood concerning the Number of Primes of the Form n 2 + a
• On the constant in the Mertens product for arithmetic progressions. I: Identities
• On the constant in the Mertens product for arithmetic progressions. II: Numerical values
• Zeta functions of groups and rings
• Zeta functions of groups: Zeros and friendly ghosts

Cited in

(3)

• Fast multi-precision computation of some Euler products
• Sums of two squares and the tau-function: Ramanujan's trail
• Euler constants from primes in arithmetic progression

This page was built for publication: Accurate computations of Euler products over primes in arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075008)