Search

Many special functions and analytic constants allow for a probabilistic representation in terms of inverse moments of [0, 1]-valued random variables. Under this assumption, we give fast computations of them with an explicit upper bound for the remainder term. One of the main features of the method is that the coefficients of the main term of the approximation always contain negative binomial probabilities which, in turn, can be precomputed and stored. Applications to the arctangent function, Dirichlet functions and their nth derivatives, and the Catalan, Gompertz, and Stieltjes constants are provided. [ABSTRACT FROM AUTHOR]

Kurokawa and Wakayama [Proc. Amer. Math. Soc. 132 (2004), pp. 935–943] defined a q-analogue of the Euler constant and proved the irrationality of certain numbers involving q-Euler constant. In this paper, we improve their results and prove the linear independence result involving q-analogue of the Euler constant. Further, we derive the closed-form of a q-analogue of the k-th Stieltjes constant \gamma _k(q). These constants are the coefficients in the Laurent series expansion of a q-analogue of the Riemann zeta function around s=1. Using a result of Nesterenko [C. R. Acad. Sci. Paris Sér. I Math. 322 (1996), pp. 909–914], we also settle down a question of Erdős regarding the arithmetic nature of the infinite series \sum _{n\geq 1}{\sigma _1(n)}/{t^n} for any integer t > 1. Finally, we study the transcendence nature of some infinite series involving \gamma _1(2). [ABSTRACT FROM AUTHOR]

We present a new asymptotic formula for the Stieltjes constants which is both simpler and more accurate than several others published in the literature (see e.g. [1-3]). More importantly, it is also a good starting point for a detailed analysis of some surprising regularities in these important constants. [ABSTRACT FROM AUTHOR]

We present a simple but efficient method of calculating Stieltjes constants at a very high level of precision, up to about 80 000 significant digits. This method is based on the hypergeometric-like expansion for the Riemann zeta function presented by one of the authors in 1997 [19]. The crucial ingredient in this method is a sequence of high-precision numerical values of the Riemann zeta function computed in equally spaced real arguments, i.e. ζ(1 + ε), ζ(1 + 2ε), ζ(1 + 3ε), ... where e is some real parameter. (Practical choice of e is described in the main text.) Such values of zeta may be readily obtained using the PARI/GP program, which is especially suitable for this. [ABSTRACT FROM AUTHOR]