Euler–Mascheroni constant

Still openEvidence checked

Subjects: Number theory · Analysis and dynamics

Reading depth

The problem

Add 1, one half, one third, and so on. Compare that sum with the area under the curve one divided by x, from 1 to the last denominator. The sum stays ahead, but the difference approaches a fixed number: about 0.57721566. This is the Euler–Mascheroni constant. Can its exact value be a fraction of two integers? For the first two terms, the sum is 1.5 and the area is about 0.6931, leaving about 0.8069; this is an approximation step, not the final constant.[1] [2]

Scope

Determine whether γ = lim[n→∞](1 + 1/2 + ⋯ + 1/n − log n) is irrational.

What remains open

We do not know whether it is rational or irrational.[1] [2]

Why it matters

The constant measures the lasting difference between adding values at separate integer points and using a smooth area to approximate them. Its exact arithmetic nature would tell us what kind of number this basic comparison produces.[2]

Definitions

3 terms
harmonic number

The sum of the first positive-integer reciprocals: Hn=1+1/2+⋯+1/nH_n=1+1/2+\cdots+1/n.[2]

natural logarithm

For a number at least 1, its natural logarithm is the area under y=1/xy=1/x from 1 to that number. It is written log⁡\log or ln⁡\ln.[2]

rational

A number equal to a/ba/b for integers a,ba,b with b≠0b\ne0. An irrational number has no such exact representation.[1]

Sources

  1. On the Uniqueness of Ein(1) among Linear Combinations of the Euler–Mascheroni and Euler–Gompertz Constants Michael R. Powers · 2025-09-30
    Notes on On the Uniqueness of Ein(1) among Linear Combinations of the Euler–Mascheroni and Euler–Gompertz Constants

    The abstract distinguishes the unresolved arithmetic nature of gamma from a transcendental combination involving it.

  2. Euler's constant: Euler's work and modern developments Jeffrey C. Lagarias · 2013-03-07
    Notes on Euler's constant: Euler's work and modern developments

    Defines the reciprocal-sum limit and explains logarithmic comparison and random-permutation cycle counts. Selected author survey passages support the examples.

Related problems

Suggest a correction