A general matrix-inversion recursion computes Euler products over primes in lattice-invariant residue classes to hundreds of digits with explicit error bounds, yielding new high-precision values of Shank's and Lal's constants.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast multi-precision computation of some Euler products
A general matrix-inversion recursion computes Euler products over primes in lattice-invariant residue classes to hundreds of digits with explicit error bounds, yielding new high-precision values of Shank's and Lal's constants.