where ζ is the Riemann zeta function. It has an approximate value of
The reciprocal of this number is the probability that any three positive integers, chosen at random, will be relatively prime (in the sense that as N goes to infinity, the probability that three positive integers < N chosen uniformly at random will be relatively prime approaches this value).
| List of numbers γ - ζ(3) - √2 - √3 - √5 - φ - α - e - π - δ | |
| Binary | 1.001100111011101... |
| Decimal | 1.2020569031595942854... |
| Hexadecimal | 1.33BA004F00621383... |
| Continued fraction | Note that this continuing fraction is not periodic. |
This value was named for Roger Apéry (1916–1994), who in 1978 proved it to be irrational. This result is known as Apéry's theorem. The original proof is complex and hard to grasp, and shorter proofs have been found later, using Legendre polynomials. It is not known whether Apéry's constant is transcendental.
Work by Wadim Zudilin and Tanguy Rivoal has shown that infinitely many of the numbers ζ(2n+1) must be irrational, and even that at least one of the numbers ζ(5), ζ(7), ζ(9), and ζ(11) must be irrational.
which was subsequently rediscovered several times.
Simon Plouffe gives several series, which are notable in that they can provide several digits of accuracy per iteration. These include :
and
Similar relations for the values of are given in the article zeta constants.
Many additional series representations have been found, including:
left(-3 + 9,k + 148,k^2 - 432,k^3 - 2688,k^4 + 7168,k^5 right) ,{k!}^3,{left(-1 + 2,k right) !}^6}{{left(-1 + 2,k right) }^3, left(3,k right) !,{left(1 + 4,k right) !}^3}
and
where
Some of these have been used to calculate Apéry's constant with several million digits. gives a series representation that allows arbitrary binary digits to be computed, and thus, for the constant to be obtained in nearly linear time, and logarithmic space.
The number of known digits of Apéry's constant ζ(3) has increased dramatically during the last decades. This is due both to the increase of performance of computers as well as to algorithmic improvements.
| Date | Decimal digits | Computation performed by |
|---|---|---|
| January 2007 | 2,000,000,000 | Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima & Paul Zimmermann |
| April 2006 | 10,000,000,000 | Shigeru Kondo & Steve Pagliarulo (see ) |
| February 2003 | 1,000,000,000 | Patrick Demichel & Xavier Gourdon |
| February 2002 | 600,001,000 | Shigeru Kondo & Xavier Gourdon |
| September 2001 | 200,001,000 | Shigeru Kondo & Xavier Gourdon |
| December 1998 | 128,000,026 | Sebastian Wedeniwski |
| February 1998 | 14,000,074 | Sebastian Wedeniwski |
| May 1997 | 10,536,006 | Patrick Demichel |
| 1997 | 1,000,000 | Bruno Haible & Thomas Papanikolaou |
| 1996 | 520,000 | Greg J. Fee & Simon Plouffe |
| 1887 | 32 | Thomas Joannes Stieltjes |
| unknown | 16 | Adrien-Marie Legendre |