On the constant in the Mertens product for arithmetic progressions. II: Numerical values
A Languasco, A Zaccagnini - Mathematics of Computation, 2009 - ams.org
Mathematics of Computation, 2009•ams.org
… In our paper [7] we gave a simpler proof of (2) and proved that the constants C(q, a)
satisfy some interesting identities but, unfortunately, these are not suitable for numerical
computations. Here we derive further identities, involving Dirichlet Lfunctions, that enable us
to compute numerically the values of C(q, a) with many digits for comparatively small q.
Details of these identities are given in §2, and the results of our … In this section we
concentrate on the numerical computation of the values of the constant C(q, a) for …
satisfy some interesting identities but, unfortunately, these are not suitable for numerical
computations. Here we derive further identities, involving Dirichlet Lfunctions, that enable us
to compute numerically the values of C(q, a) with many digits for comparatively small q.
Details of these identities are given in §2, and the results of our … In this section we
concentrate on the numerical computation of the values of the constant C(q, a) for …
Abstract
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions , for ,…, and . References
ams.org
以上显示的是最相近的搜索结果。 查看全部搜索结果