paper

A fast algorithm to compute the Ramanujan-Deninger gamma-function and some number-theoretic applications

arXiv:2005.10046 · doi:10.1090/mcom/3668

Abstract

We introduce a fast algorithm to compute the Ramanujan-Deninger gamma function and its logarithmic derivative at positive values. Such an algorithm allows us to greatly extend the numerical investigations about the Euler-Kronecker constants , and , where is an odd prime, runs over the primitive Dirichlet characters , is the trivial Dirichlet character and is the Dirichlet -function associated to . Using such algorithms we obtained that and thus getting a new negative value for . Moreover we also computed , and for every odd prime , , thus extending previous results. As a consequence we obtain that both and are positive for every odd prime up to and that for every odd prime . In fact the lower bound holds true for . The programs used and the results here described are collected at the following address \url{http://www.math.unipd.it/~languasc/Scomp-appl.html}.

to appear in Math. Comp. Inserted section 5.7 and two histograms. Several typos corrected

References in corpus (1)

Cited by in corpus (8)