Euler's constant γ is not known to be rational or irrational. The standard constructive route to irrationality — Apéry's method for ζ(3) — needs integer linear forms q_n γ − p_n whose decay beats the growth of their denominators. All known constructions (Aptekarev et al. 2007; Rivoal 2009; Hessami Pilehrood and Hessami Pilehrood 2011–2013; Wolfs and Van Assche 2025) achieve only sub-exponential quality: errors of order e−cne^{-c\sqrt{n}} or e−cn3/4e^{-cn^{3/4}} against denominators growing like exp⁡((1+o(1)) nlog⁡n)\exp((1+o(1))\,n\log n), which no irrationality criterion can use. The problem is to construct Apéry-type approximations to γ in which numerator and denominator both solve one second-order homogeneous linear recurrence with polynomial coefficients, or otherwise to produce integer linear forms in 1 and γ of genuinely better-than-sub-exponential quality, so that an irrationality criterion applies. The most recent literature (through 2026) treats this as open.

Background

Euler's (Euler–Mascheroni) constant is γ=lim⁡n→∞(1+1/2+⋯+1/n−log⁡n)≈0.5772156…\gamma=\lim_{n\to\infty}(1+1/2+\cdots+1/n-\log n)\approx 0.5772156\ldots, equivalently γ=−∫0∞e−xlog⁡x dx\gamma=-\int_0^\infty e^{-x}\log x\,dx; it equals −ψ(1)-\psi(1), where ψ=Γ′/Γ\psi=\Gamma'/\Gamma is the digamma function, the logarithmic derivative of the Gamma function. Whether γ\gamma is irrational is one of the oldest open problems in the arithmetic of constants; it is recorded as open in every account of the subject from Euler's own work to Lagarias's 2013 survey of Euler's constant and modern developments.

A classical and elementary criterion drives the whole subject: if a real number x=a/bx=a/b is rational, then every rational p/q≠xp/q\ne x satisfies ∣x−p/q∣≥1/(bq)|x-p/q|\ge 1/(bq); consequently, if infinitely many integer pairs (pn,qn)(p_n,q_n) with qn>0q_n>0, qn→∞q_n\to\infty, and qnx−pn≠0q_nx-p_n\ne0 have qnx−pn→0q_nx-p_n\to0 — the nonzero integer linear forms in 1 and xx tend to zero — then xx is irrational. A stronger, power-saving version of the same criterion requires ∣qnx−pn∣≤C qn−1−δ|q_n x-p_n|\le C\,q_n^{-1-\delta} for some constants C>0C>0 and δ>0\delta>0, so that the decay of the integer linear forms beats the denominator growth by a power; this stronger bound is the quantitative target of option (b) below. Refined quantitative versions, such as the linear-independence criterion of Nesterenko, extract from any such imbalance a lower bound on the Q\mathbb{Q}-dimension of the span of the numbers involved.

Apéry's 1979 proof of the irrationality of Apéry's constant ζ(3)=∑m≥1m−3\zeta(3)=\sum_{m\ge1}m^{-3} is the archetype. He exhibited integer sequences (un)(u_n), (vn)(v_n), both solutions of the single second-order homogeneous linear recurrence (n+1)3yn+1−(34n3+51n2+27n+5)yn+n3yn−1=0(n+1)^3y_{n+1}-(34n^3+51n^2+27n+5)y_n+n^3y_{n-1}=0 with coefficients polynomial in nn, such that vn/un→ζ(3)v_n/u_n\to\zeta(3) with geometrically decaying error against geometrically growing denominators, and the criterion above applies. By the Poincaré–Perron theory of linear recurrences — solutions of a recurrence with polynomial coefficients grow like products of powers of the characteristic roots, so the ratio of a dominant and a subdominant solution decays geometrically — any pair of integer sequences solving one and the same genuinely second-order homogeneous recurrence with polynomial coefficients and characteristic roots of separated moduli, and converging to a limit, automatically has this geometric balance. A genuinely Apéry-type pair for γ\gamma is therefore expected to be decisive for irrationality, and its absence is exactly the gap recorded here.

For γ\gamma the state of the art is far weaker. Aptekarev and collaborators (2007) found the first good rational approximations to γ\gamma, generated by a third-order homogeneous recurrence, with error of order e−22ne^{-2\sqrt{2n}} but denominators comparable to (2n)!(2n)!; the linear forms do not tend to zero even after cancelling their large common factor built from factorials and least common multiples. Rivoal (2009) constructed forms from simultaneous Padé approximants (rational simultaneous approximants generalizing continued fractions) to Euler-type integrals, governed by a sixth-order recurrence; the Hessami Pilehroods proved his conjectures on denominators (2011) and reorganized the theory through Meijer G-functions — a standard class of generalized hypergeometric integrals — obtaining approximations whose denominators solve the second-order homogeneous recurrence qn+2−2(n+2)qn+1+(n+1)2qn=0q_{n+2}-2(n+2)q_{n+1}+(n+1)^2q_n=0 while the numerators solve only the corresponding inhomogeneous recurrence, with error of order e−4ne^{-4\sqrt n} and denominators n! e2nn!\,e^{2\sqrt n} up to polynomial factors; the same homogeneous recurrence generates Stieltjes's 1895 continued fraction for the Euler–Gompertz constant δ=∫0∞e−x/(1+x) dx≈0.5963…\delta=\int_0^\infty e^{-x}/(1+x)\,dx\approx 0.5963\ldots. The structural obstruction throughout is factorial/lcm-type coefficient growth: log⁡qn≍nlog⁡n\log q_n\asymp n\log n while −log⁡∣γ−pn/qn∣=O(n3/4)-\log|\gamma-p_n/q_n|=O(n^{3/4}) at best, so the error is only qn−o(1)q_n^{-o(1)} — sub-exponential quality — and no criterion can consume it. The arithmetic nature of δ\delta is likewise open, though Rivoal (2012), applying Shidlovskii's theorem on values of E-functions (entire functions satisfying linear differential equations with polynomial coefficients), proved that at least one of γ\gamma and δ\delta is transcendental, without deciding which.

The frontier of the program (Wolfs and Van Assche 2025, using multiple orthogonal polynomials — polynomials orthogonal with respect to several weights simultaneously, here attached to the exponential integral — and strong asymptotic methods) pushes the error to exp⁡(−c n3/4)\exp(-c\,n^{3/4}) and proposes families reaching exp⁡(−cp n(p+2)/(p+3))\exp(-c_p\,n^{(p+2)/(p+3)}); every known or proposed exponent is o(n)o(n), hence still sub-exponential against log⁡qn≍nlog⁡n\log q_n\asymp n\log n. The one modification producing exponentially decaying errors inserts a logarithm with an nn-dependent argument, which destroys the integrality structure the criterion needs. Closing this gap is the problem.

Problem Statement

This is an open problem in the rational-approximation literature for Euler's constant: construct integer sequences (pn)n≥0(p_n)_{n\ge0} and (qn)n≥0(q_n)_{n\ge0} with qn>0q_n>0, qn→∞q_n\to\infty, the two sequences not both identically zero, such that either (a) both sequences are solutions of one and the same genuinely second-order homogeneous linear recurrence with coefficients polynomial in nn — that is, a recurrence A(n) yn+1+B(n) yn+C(n) yn−1=0A(n)\,y_{n+1}+B(n)\,y_n+C(n)\,y_{n-1}=0 whose leading coefficient A(n)A(n) is not identically zero and whose characteristic roots have separated moduli (their ratio bounded away from 11 in modulus: ∣r1(n)/r2(n)∣≤θ<1|r_1(n)/r_2(n)|\le\theta<1 for all large nn, for the two characteristic roots r1(n),r2(n)r_1(n),r_2(n) and some constant θ\theta) — a genuinely Apéry-type construction — and pn/qn→γp_n/q_n\to\gamma with qnγ−pn≠0q_n\gamma-p_n\ne0 for all large nn and qnγ−pn→0q_n\gamma-p_n\to0; or (b) the integer linear forms in 1 and γ\gamma satisfy a better-than-sub-exponential quality bound, namely that constants C>0C>0 and δ>0\delta>0 exist with qnγ−pn≠0q_n\gamma-p_n\ne0 and ∣qnγ−pn∣≤C qn−1−δ|q_n\gamma-p_n|\le C\,q_n^{-1-\delta} for all large nn (equivalently ∣γ−pn/qn∣≤C qn−2−δ|\gamma-p_n/q_n|\le C\,q_n^{-2-\delta}). By the classical criterion recalled in the Background, (a) with its forced geometric decay, or (b) directly, implies that γ\gamma is irrational. Every known construction gives sub-exponential quality only — ∣γ−pn/qn∣|\gamma-p_n/q_n| of size qn−o(1)q_n^{-o(1)}, with errors e−cne^{-c\sqrt n} (Aptekarev et al. 2007; Hessami Pilehrood 2013) or e−cn3/4e^{-cn^{3/4}} (Wolfs–Van Assche 2025) against log⁡qn≍nlog⁡n\log q_n\asymp n\log n.

References

  1. Roger Apéry, Irrationalité de ζ(2) et ζ(3), Astérisque 61 (1979), 11–13. Zbl 0401.10049. https://geodesic.mathdoc.fr/item/AST_1979__61__11_0/
  2. A. I. Aptekarev, Preface [to the volume: Rational approximants for the Euler constant], Proceedings of the Steklov Institute of Mathematics 272 (2011), no. S2, 138–141. DOI 10.1134/S0081543811030072. https://doi.org/10.1134/S0081543811030072 (English translation of the preface to the 2007 Steklov volume 'Rational approximation of Euler's constant and recurrence relations', Current Problems in Mathematics 9)
  3. A. I. Aptekarev, On linear forms containing the Euler constant, arXiv:0902.1768 (2009). https://arxiv.org/abs/0902.1768
  4. Tanguy Rivoal, Rational approximations for values of derivatives of the Gamma function, Transactions of the American Mathematical Society 361 (2009), no. 11, 6115–6149. DOI 10.1090/S0002-9947-09-04905-8. https://doi.org/10.1090/S0002-9947-09-04905-8
  5. T. Hessami Pilehrood and Kh. Hessami Pilehrood, Rational approximations to values of the digamma function and a conjecture on denominators, Mathematical Notes 90 (2011), no. 5–6, 730–747. DOI 10.1134/S0001434611110113. https://doi.org/10.1134/S0001434611110113 (arXiv:1004.0578)
  6. Kh. Hessami Pilehrood and T. Hessami Pilehrood, Rational approximations to values of Bell polynomials at points involving Euler's constant and zeta values, Journal of the Australian Mathematical Society 92 (2012), no. 1, 71–98. DOI 10.1017/S1446788712000134. https://doi.org/10.1017/S1446788712000134 (arXiv:1011.3833)
  7. Tanguy Rivoal, On the arithmetic nature of the values of the gamma function, Euler's constant, and Gompertz's constant, Michigan Mathematical Journal 61 (2012), no. 2, 239–254. DOI 10.1307/mmj/1339011525. https://doi.org/10.1307/mmj/1339011525
  8. Kh. Hessami Pilehrood and T. Hessami Pilehrood, On a continued fraction expansion for Euler's constant, Journal of Number Theory 133 (2013), no. 2, 769–786. DOI 10.1016/j.jnt.2012.08.016. https://doi.org/10.1016/j.jnt.2012.08.016 (arXiv:1010.1420)
  9. Jonathan Sondow, Criteria for irrationality of Euler's constant, Proceedings of the American Mathematical Society 131 (2003), no. 11, 3335–3344. DOI 10.1090/S0002-9939-03-07081-3. https://doi.org/10.1090/S0002-9939-03-07081-3
  10. Jeffrey C. Lagarias, Euler's constant: Euler's work and modern developments, Bulletin of the American Mathematical Society 50 (2013), no. 4, 527–628. DOI 10.1090/S0273-0979-2013-01423-X. https://doi.org/10.1090/S0273-0979-2013-01423-X (arXiv:1303.1856)
  11. José A. Adell and Alberto Lekuona, Rational approximation to Euler's constant at a geometric rate of convergence, Mathematics of Computation 89 (2020), no. 325, 2553–2561. DOI 10.1090/mcom/3528. https://doi.org/10.1090/mcom/3528
  12. M. Prévost and T. Rivoal, Application of Padé approximation to Euler's constant and Stirling's formula, The Ramanujan Journal 54 (2021), no. 1, 177–195. DOI 10.1007/s11139-019-00201-9. https://doi.org/10.1007/s11139-019-00201-9
  13. Walter Van Assche and Thomas Wolfs, Rational approximation of Euler's constant using multiple orthogonal polynomials, Combinatorics and Number Theory 14 (2025), no. 2, 141–162. DOI 10.2140/cnt.2025.14.141. https://doi.org/10.2140/cnt.2025.14.141 (arXiv:2404.09799)
  14. A. I. Aptekarev, Multiple orthogonal polynomials and strong Szegő asymptotics, Russian Mathematical Surveys 81 (2026), no. 2, 209–273. DOI 10.4213/rm10281e. https://doi.org/10.4213/rm10281e