On the Khintchine constant
Open Access
- 1 January 1997
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (217) , 417-432
- https://doi.org/10.1090/s0025-5718-97-00800-4
Abstract
We present rapidly converging series for the Khintchine constant and for general ``Khintchine means'' of continued fractions. We show that each of these constants can be cast in terms of an efficient free-parameter series, each series involving values of the Riemann zeta function, rationals, and logarithms of rationals. We provide an alternative, polylogarithm series for the Khintchine constant and indicate means to accelerate such series. We discuss properties of some explicit continued fractions, constructing specific fractions that have limiting geometric mean equal to the Khintchine constant. We report numerical evaluations of such special numbers and of various Khintchine means. In particular, we used an optimized series and a collection of fast algorithms to evaluate the Khintchine constant to more than 7000 decimal places.Keywords
This publication has 10 references indexed in Scilit:
- Computation of Continued Fractions Without Input ValuesMathematics of Computation, 1995
- Explicit evaluation of Euler sumsProceedings of the Edinburgh Mathematical Society, 1995
- Experimental Evaluation of Euler SumsExperimental Mathematics, 1994
- Irregular Primes and Cyclotomic Invariants to Four MillionMathematics of Computation, 1993
- Irregular Primes to One MillionMathematics of Computation, 1992
- Random Number Generation and Quasi-Monte Carlo MethodsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992
- Ramanujan’s NotebooksPublished by Springer Nature ,1991
- A construction of a normal number for the continued fraction transformationJournal of Number Theory, 1981
- Further Evaluation of Khintchine's ConstantMathematics of Computation, 1960
- On the ergodic theorems (II) (Ergodic theory of continued fractions)Studia Mathematica, 1951