On the Khintchine constant

  • Bailey D
  • Borwein J
  • Crandall R
21Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Bailey, D. H., Borwein, J. M., & Crandall, R. E. (1997). On the Khintchine constant. Mathematics of Computation, 66(217), 417–432. https://doi.org/10.1090/s0025-5718-97-00800-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free