posted on 2025-05-10, 08:30authored byDavid H. Bailey, Jonathan M. Borwein, Richard E. Crandall
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.
History
Journal title
Mathematics of Computation
Volume
66
Issue
217
Pagination
417-431
Publisher
American Mathematical Society
Language
en, English
College/Research Centre
Faculty of Science and Information Technology
School
School of Mathematical and Physical Sciences
Rights statement
First published in Mathematics of Computation in Vol. 66, no. 217, 1997, published by the American Mathematical Society