Accurate computations of Euler products over primes in arithmetic progressions (Q2075008)

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.