• CONTACT
  • LAST ISSUE
  • IN PROGRESS
  • EARLY VIEW
  • ACCEPTED PAPERS
GET_pdf

Volume 26 (3) 2020, 77–87

Are the Stieltjes constants irrational? Some computer experiments

Maślanka Krzysztof 1, Wolf Marek 2

1 Institute for the History of Science, Polish Academy of Sciences
ul. Nowy Świat 72, 00-330 Warsaw, Poland
E-mail: krzysiek2357@gmail.com

2 Cardinal Stefan Wyszynski University
Faculty of Mathematics and Natural Sciences, College of Sciences
ul. Wóycickiego 1/3, 01-938 Warsaw, Poland
E-mail: m.wolf@uksw.edu.pl

Received:

Received: 31 August 2020; revised: 19 September 2020; accepted: 22 September 2020; published online: 29 September 2020

DOI:   10.12921/cmst.2020.0000026

Abstract:

Khnichin’s theorem is a surprising and still relatively little known result. It can be used as a specific criterion for determining whether or not any given number is irrational. In this paper we apply this theorem as well as the Gauss-Kuzmin theorem to several thousand high precision (up to more than 53 000 significant digits) initial Stieltjes constants n, n = 0, 1, 2, …, 5000 in order to confirm that, as is commonly believed, they are irrational numbers (and even transcendental). We also study the normality of these important constants.

Key words:

continued fractions, experimental mathematics, Khinchin’s theorem, normality, Riemann zeta function

References:

[1] L. Euler, Variae observationes circa series infinitas, Commentarii academiae scientiarum Petropolitanae 9, 160–188 (1744).
[2] B. Riemann, Üeber die Anzahl der Primzahlen unter einer gegebenen Grösse, Monatsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, 671–680 (1859). English translation available at http://www.maths.tcd.ie/pub/HistMath/People/Riemann
[3] E.W. Weisstein, CRC Concise Encyclopedia of Mathematics, Chapman & Hall/CRC (2009).
[4] M. Milgram, Integral and Series Representations of Riemann’s Zeta Function and Dirichlet’s Eta Function and a Medley of Related Results, Journal of Mathematics 2013, 181724 (2013).
[5] C. Hermite, T.J. Stieltjes, Correspondance d’Hermite et de Stieltjes, Vol. 1 (1905).
[6] D.W. Sweeney, On the Computation of Euler’s Constant, Mathematics of Computation 17(82), 170 (1963).
[7] R.P. Brent, E.M. McMillan, Some New Algorithms for High-Precision Computation of Euler’s Constant, Mathematics of Computation 34(149), 305–312 (1980).
[8] J.B. Keiper, Power series expansions of Riemann’s ξ function, Mathematics of Computation 58(198), 765–765 (1992).
[9] R. Kreminski, Newton-Cotes integration for approximating Stieltjes (generalized Euler) constants, Mathematics of Computation 72(243), 1379–1397 (2002).
[10] F. Johansson, Rigorous high-precision computation of the Hurwitz zeta function and its derivatives, Numerical Algorithms 69(2), 253–270 (2014).
[11] G. Martin, The unreasonable effectualness of continued function expansions, Journal of the Australian Mathematical Society 77(3), 305–320 (2004).
[12] A.Y. Khinchin, Continued Fractions, Dover Publications, New York (1997).
[13] S.R. Finch, Mathematical Constants, Cambridge University Press (2003).
[14] R.P. Brent, Computation of the regular continued fraction for Euler’s constant, Mathematics of Computation 31(139), 771–777 (1977).
[15] C. Ryll-Nardzewski, On the ergodic theorems II (Ergodic theory of continued fractions), Studia Mathematica 12, 74–79 (1951).
[16] PARI/GP version 2.11.2, 64 bits (2019). Available at http://pari.math.u-bordeaux.fr/
[17] K. Maślanka, A hypergeometric-like Representation of Zetafunction of Riemann, Cracow Observatory preprint no. 1997/60 (1997). Posted at arXiv: math-ph/0105007 (2001). Available at http://xxx.lanl.gov/abs/math/0105007

  • JOURNAL MENU

    • AIMS AND SCOPE
    • EDITORS
    • EDITORIAL BOARD
    • NOTES FOR AUTHORS
    • CONTACT
    • IAN SNOOK PRIZES 2015
    • IAN SNOOK PRIZES 2016
    • IAN SNOOK PRIZES 2017
    • IAN SNOOK PRIZES 2018
    • IAN SNOOK PRIZES 2019
    • IAN SNOOK PRIZES 2020
    • IAN SNOOK PRIZES 2021
    • IAN SNOOK PRIZES 2024
  • GALLERY

  • LAST ISSUE

  • MANUSCRIPT SUBMISSION

    • SUBMIT A MANUSCRIPT
  • FUTURE ISSUES

    • ACCEPTED PAPERS
    • EARLY VIEW
    • Volume 31 (1) – in progress
  • ALL ISSUES

    • 2024
      • Volume 30 (3–4)
      • Volume 30 (1–2)
    • 2023
      • Volume 29 (1–4)
    • 2022
      • Volume 28 (4)
      • Volume 28 (3)
      • Volume 28 (2)
      • Volume 28 (1)
    • 2021
      • Volume 27 (4)
      • Volume 27 (3)
      • Volume 27 (2)
      • Volume 27 (1)
    • 2020
      • Volume 26 (4)
      • Volume 26 (3)
      • Volume 26 (2)
      • Volume 26 (1)
    • 2019
      • Volume 25 (4)
      • Volume 25 (3)
      • Volume 25 (2)
      • Volume 25 (1)
    • 2018
      • Volume 24 (4)
      • Volume 24 (3)
      • Volume 24 (2)
      • Volume 24 (1)
    • 2017
      • Volume 23 (4)
      • Volume 23 (3)
      • Volume 23 (2)
      • Volume 23 (1)
    • 2016
      • Volume 22 (4)
      • Volume 22 (3)
      • Volume 22 (2)
      • Volume 22 (1)
    • 2015
      • Volume 21 (4)
      • Volume 21 (3)
      • Volume 21 (2)
      • Volume 21 (1)
    • 2014
      • Volume 20 (4)
      • Volume 20 (3)
      • Volume 20 (2)
      • Volume 20 (1)
    • 2013
      • Volume 19 (4)
      • Volume 19 (3)
      • Volume 19 (2)
      • Volume 19 (1)
    • 2012
      • Volume 18 (2)
      • Volume 18 (1)
    • 2011
      • Volume 17 (1-2)
    • 2010
      • Volume SI (2)
      • Volume SI (1)
      • Volume 16 (2)
      • Volume 16 (1)
    • 2009
      • Volume 15 (2)
      • Volume 15 (1)
    • 2008
      • Volume 14 (2)
      • Volume 14 (1)
    • 2007
      • Volume 13 (2)
      • Volume 13 (1)
    • 2006
      • Volume SI (1)
      • Volume 12 (2)
      • Volume 12 (1)
    • 2005
      • Volume 11 (2)
      • Volume 11 (1)
    • 2004
      • Volume 10 (2)
      • Volume 10 (1)
    • 2003
      • Volume 9 (1)
    • 2002
      • Volume 8 (2)
      • Volume 8 (1)
    • 2001
      • Volume 7 (2)
      • Volume 7 (1)
    • 2000
      • Volume 6 (1)
    • 1999
      • Volume 5 (1)
    • 1998
      • Volume 4 (1)
    • 1997
      • Volume 3 (1)
    • 1996
      • Volume 2 (1)
      • Volume 1 (1)
  • DATABASES

    • AUTHORS BASE
  • CONTACT
  • LAST ISSUE
  • IN PROGRESS
  • EARLY VIEW
  • ACCEPTED PAPERS

© 2025 CMST