Apéry's constant

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description Template:CS1 config Template:Infobox non-integer number

In mathematics, Apéry's constant is the infinite sum of the reciprocals of the positive integers, cubed. That is, it is defined as the number

ζ(3)=n=11n3=limn(113+123++1n3),

where Template:Mvar is the Riemann zeta function. It has an approximate value ofTemplate:Sfnp

Template:Math (sequence A002117 in the OEIS).

It is named after Roger Apéry, who proved that it is an irrational number.

Uses

Apéry's constant arises naturally in a number of physical problems, including in the second- and third-order terms of the electron's gyromagnetic ratio using quantum electrodynamics. It also arises in the analysis of random minimum spanning treesTemplate:Sfnp and in conjunction with the gamma function when solving certain integrals involving exponential functions in a quotient, which appear occasionally in physics, for instance, when evaluating the two-dimensional case of the Debye model and the Stefan–Boltzmann law.

The reciprocal of Template:Math (0.8319073725807... (sequence A088453 in the OEIS)) is the probability that any three positive integers, chosen at random, will be relatively prime, in the sense that as Template:Math approaches infinity, the probability that three positive integers less than Template:Math chosen uniformly at random will not share a common prime factor approaches this value. (The probability for n positive integers is Template:Math.Template:Sfnp) In the same sense, it is the probability that a positive integer chosen at random will not be evenly divisible by the cube of an integer greater than one. (The probability for not having divisibility by an n-th power is Template:Math.Template:Sfnp)

Properties

<templatestyles src="Unsolved/styles.css" />

Unsolved problem in mathematics
Is Apéry's constant transcendental?

Template:Math was named Apéry's constant after the French mathematician Roger Apéry, who proved in 1978 that it is an irrational number.Template:Sfnp This result is known as Apéry's theorem. The original proof is complex and hard to grasp,Template:Sfnp and simpler proofs were found later.[1]

Beukers's simplified irrationality proof involves approximating the integrand of the known triple integral for Template:Math,

ζ(3)=01010111xyzdxdydz,

by the Legendre polynomials. In particular, van der Poorten's article chronicles this approach by noting that

I3:=120101Pn(x)Pn(y)log(xy)1xydxdy=bnζ(3)an,

where |I|ζ(3)(12)4n, Pn(z) are the Legendre polynomials, and the subsequences bn,2lcm(1,2,,n)an are integers or almost integers.

Many people have tried to extend Apéry's proof that Template:Math is irrational to other values of the Riemann zeta function with odd arguments. Although this has so far not produced any results on specific numbers, it is known that infinitely many of the odd zeta constants Template:Math are irrational.Template:Sfnp In particular at least one of Template:Math, Template:Math, Template:Math, and Template:Math must be irrational.Template:Sfnp

Apéry's constant has not yet been proved transcendental, but it is known to be an algebraic period. This follows immediately from the form of its triple integral.

Series representations

Classical

In addition to the fundamental series:

ζ(3)=k=11k3,

Leonhard Euler gave the series representation:Template:Sfnp

ζ(3)=π27(14k=1ζ(2k)22k(2k+1)(2k+2))

in 1772, which was subsequently rediscovered several times.Template:Sfnp

Fast convergence

Since the 19th century, a number of mathematicians have found convergence acceleration series for calculating decimal places of Template:Math. Since the 1990s, this search has focused on computationally efficient series with fast convergence rates (see section "Known digits").

The following series representation was found by A. A. Markov in 1890,Template:Sfnp rediscovered by Hjortnaes in 1953,Template:Sfnp and rediscovered once more and widely advertised by Apéry in 1979:Template:Sfnp

ζ(3)=52k=1(1)k1k!2(2k)!k3.

The following series representation gives (asymptotically) 1.43 new correct decimal places per term:Template:Sfnp

ζ(3)=14k=1(1)k1(k1)!3(56k232k+5)(2k1)2(3k)!.

The following series representation gives (asymptotically) 3.01 new correct decimal places per term:Template:Sfnp

ζ(3)=164k=0(1)kk!10(205k2+250k+77)(2k+1)!5.

The following series representation gives (asymptotically) 5.04 new correct decimal places per term:[2]

ζ(3)=124k=0(1)k(2k+1)!3(2k)!3k!3(126392k5+412708k4+531578k3+336367k2+104000k+12463)(3k+2)!(4k+3)!3.

It has been used to calculate Apéry's constant with several million correct decimal places.[3]

The following series representation gives (asymptotically) 3.92 new correct decimal places per term:Template:Sfnp

ζ(3)=12k=0(1)k(2k)!3(k+1)!6(40885k5+124346k4+150160k3+89888k2+26629k+3116)(k+1)2(3k+3)!4.

Digit by digit

In 1998, Broadhurst gave a series representation that allows arbitrary binary digits to be computed, and thus, for the constant to be obtained by a spigot algorithm in nearly linear time and logarithmic space.Template:Sfnp

Thue-Morse sequence

Apéry's constant can be represented in terms of the Thue-Morse sequence (tn)n0, as follows:[4]

n19tn1+7tnn3=8ζ(3),

This is a special case of the following formula (valid for all s with real part greater than 1):

(2s+1)n1tn1ns+(2s1)n1tnns=2sζ(s).

Others

The following series representation was found by Ramanujan:[5]

ζ(3)=7180π32k=11k3(e2πk1).

The following series representation was found by Simon Plouffe in 1998:Template:Sfnp

ζ(3)=14k=11k3sinh(πk)112k=11k3(e2πk1)72k=11k3(e2πk+1).

Template:Harvtxt collected many series that converge to Apéry's constant.

Integral representations

There are numerous integral representations for Apéry's constant. Some of them are simple, others are more complicated.

Simple formulas

The following formula follows directly from the integral definition of the zeta function:

ζ(3)=120x2ex1dx

More complicated formulas

Other formulas includeTemplate:Sfnp

ζ(3)=π0cos(2arctanx)(x2+1)(cosh12πx)2dx

andTemplate:Sfnp

ζ(3)=120101log(xy)1xydxdy=0101log(1xy)xydxdy.

Also,Template:Sfnp

ζ(3)=8π2701x(x44x2+1)loglog1x(1+x2)4dx=8π271x(x44x2+1)loglogx(1+x2)4dx.

A connection to the derivatives of the gamma function[6]

ζ(3)=12(Γ(1)+γ3+12π2γ)=12ψ(2)(1)

is also very useful for the derivation of various integral representations via the known integral formulas for the gamma and polygamma functions.Template:Sfnp

Continued fraction

Apéry's constant is related to the following continued fraction:[7]

6ζ(3)=511176453572914364096310515625

with an=34n3+51n2+27n+5 and bn=n6.

Its simple continued fraction is given by:[8]

ζ(3)=1+14+11+118+11+11+1

Known digits

The number of known digits of Apéry's constant Template:Math has increased dramatically during the last decades, and now stands at more than Template:Val. This is due both to the increasing performance of computers and to algorithmic improvements.

Number of known decimal digits of Apéry's constant Template:Math
Date Decimal digits Computation performed by
1735 16 Leonhard Euler
Unknown 16 Adrien-Marie Legendre
1887 32 Thomas Joannes Stieltjes
1996 Template:Val Greg J. Fee & Simon Plouffe
1997 Template:Val Bruno Haible & Thomas Papanikolaou
May 1997 Template:Val Patrick Demichel
February 1998 Template:Val Sebastian Wedeniwski
March 1998 Template:Val Sebastian Wedeniwski
July 1998 Template:Val Sebastian Wedeniwski
December 1998 Template:Val Sebastian WedeniwskiTemplate:Sfnp
September 2001 Template:Val Shigeru Kondo & Xavier Gourdon
February 2002 Template:Val Shigeru Kondo & Xavier Gourdon
February 2003 Template:Val Patrick Demichel & Xavier GourdonTemplate:Sfnp
April 2006 Template:Val Shigeru Kondo & Steve Pagliarulo
January 21, 2009 Template:Val Alexander J. Yee & Raymond ChanTemplate:Sfnp
February 15, 2009 Template:Val Alexander J. Yee & Raymond ChanTemplate:Sfnp
September 17, 2010 Template:Val Alexander J. YeeTemplate:Sfnp
September 23, 2013 Template:Val Robert J. SettiTemplate:Sfnp
August 7, 2015 Template:Val Ron WatkinsTemplate:Sfnp
December 21, 2015 Template:Val Dipanjan NagTemplate:Sfnp
August 13, 2017 Template:Val Ron WatkinsTemplate:Sfnp
May 26, 2019 Template:Val Ian Cutress[9]
July 26, 2020 Template:Val Seungmin Kim[9][10]
December 22, 2023 Template:Val Andrew Sun[9]

See also

Notes

Template:Reflist

References

Template:Refbegin

  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1". (Message to Simon Plouffe, with all decimal places but a shorter text edited by Simon Plouffe).
  • Script error: No such module "citation/CS1". (Message to Simon Plouffe, with original text but only some decimal places).
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1"..

Template:Refend

Further reading

  • Script error: No such module "citation/CS1"..
  • Script error: No such module "citation/CS1".

External links

  • Script error: No such module "Template wrapper".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1"..

This article incorporates material from Apéry's constant on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License. Template:Irrational number

  1. Template:Harvtxt; Template:Harvtxt.
  2. Template:Harvtxt; Template:Harvtxt. In his message to Simon Plouffe, Sebastian Wedeniwski states that he derived this formula from Template:Harvtxt. The discovery year (1998) is mentioned in Simon Plouffe's Table of Records (8 April 2001).
  3. Template:Harvtxt; Template:Harvtxt.
  4. Script error: No such module "citation/CS1".
  5. Template:Harvtxt.
  6. Script error: No such module "citation/CS1".
  7. Script error: No such module "citation/CS1".
  8. Script error: No such module "citation/CS1".
  9. a b c Script error: No such module "citation/CS1"..
  10. Script error: No such module "citation/CS1"..