Leibniz formula for π

mathematical constant $π$
Part of a series of articles on the

Uses
Area of disk Circumference Use in other formulae
Properties
Irrationality Transcendence
Value
Less than 22/7 Approximations Memorization
People
Archimedes Liu Hui Zu Chongzhi Aryabhata Madhava Ludolph van Ceulen Seki Takakazu Takebe Katahiro William Jones John Machin William Shanks John Wrench Chudnovsky brothers Yasumasa Kanada
History
Chronology Book
In culture
Legislation Holiday
Related topics
Squaring the circle Basel problem Six nines in $π$ Other topics related to $π$

See List of things named after Gottfried Leibniz for other formulas known under the same name.

In mathematics, the Leibniz formula for $π$ , named after Gottfried Leibniz, states that

1 \,-\, \frac{1}{3} \,+\, \frac{1}{5} \,-\, \frac{1}{7} \,+\, \frac{1}{9} \,-\, \cdots \;=\; \frac{\pi}{4}.\!

Using summation notation:

\sum_{n=0}^\infty \, \frac{(-1)^n}{2n+1} \;=\; \frac{\pi}{4}.\!

Names

The infinite series above has also been called the Leibniz series or Gregory–Leibniz series (after the work of James Gregory), or more recently Madhava-Leibniz series, after the discovery that it is a special case of a more general series expansion for the inverse tangent function, first discovered by Indian mathematician Madhava of Sangamagrama in 14th century. The series for the inverse tangent function, which is also known as Gregory's series, can be given by:

\arctan x = x - \frac{x^3}{3} + \frac{x^5}{5} - \frac{x^7}{7} + \cdots

The Leibniz formula for $π$ can be obtained by plugging x = 1 into the above inverse-tangent series.^[1]

It also is the Dirichlet L-series of the non-principal Dirichlet character of modulus 4 evaluated at $s=1$ , and therefore the value $β (1)$ of the Dirichlet beta function.

Proof

{\begin{align} \frac{\pi}{4} & = \arctan(1)\;=\;\int_0^1 \frac 1{1+x^2} \, dx \\[8pt] & = \int_0^1\left(\sum_{k=0}^n (-1)^k x^{2k}+\frac{(-1)^{n+1}\,x^{2n+2} }{1+x^2}\right) \, dx \\[8pt] & = \sum_{k=0}^n \frac{(-1)^k}{2k+1} +(-1)^{n+1}\int_0^1\frac{x^{2n+2}}{1+x^2} \, dx. \end{align}}

Considering only the integral in the last line, we have:

0 < \int_0^1 \frac{x^{2n+2}}{1+x^2}\,dx \;<\; \int_0^1 x^{2n+2}\,dx \;=\; \frac{1}{2n+3} \;\rightarrow\; 0 \text{ as } n \rightarrow \infty.\!

Therefore, as $n \to \infty$ we are left with the Leibniz series:

\frac{\pi}4\;=\;\sum_{k=0}^\infty\frac{(-1)^k}{2k+1}.

for a more detailed proof, together with the original geometric proof by Leibniz himself, see Leibniz's Formula for Pi ^[2]

Convergence

Comparison of the convergence of the Leibniz formula (cyan squares) and several historical infinite series for

π

. S_n is the approximation after taking n terms. Each subsequent subplot magnifies the shaded area horizontally by 10 times. (click for detail)

Leibniz's formula converges extremely slowly: it exhibits sublinear convergence. Calculating $π$ to 10 correct decimal places using direct summation of the series requires about five billion terms because $\scriptstyle \frac 1{2k+1}<10^{-10}$ for $\scriptstyle k>\frac{10^{10}-1}2$ .

However, the Leibniz formula can be used to calculate $π$ to high precision (hundreds of digits or more) using various convergence acceleration techniques. For example, the Shanks transformation, Euler transform or Van Wijngaarden transformation, which are general methods for alternating series, can be applied effectively to the partial sums of the Leibniz series. Further, combining terms pairwise gives the non-alternating series

\frac{\pi}{4} = \sum_{n=0}^{\infty} \bigg(\frac{1}{4n+1}-\frac{1}{4n+3}\bigg) = \sum_{n=0}^{\infty} \frac{2}{(4n+1)(4n+3)}

which can be evaluated to high precision from a small number of terms using Richardson extrapolation or the Euler–Maclaurin formula. This series can also be transformed into an integral by means of the Abel–Plana formula and evaluated using techniques for numerical integration.

Unusual behavior

If the series is truncated at the right time, the decimal expansion of the approximation will agree with that of $π$ for many more digits, except for isolated digits or digit groups. For example, taking five million terms yields

3.1415924535897932384646433832795027841971693993873058...

where the underlined digits are wrong. The errors can in fact be predicted; they are generated by the Euler numbers $E n$ according to the asymptotic formula

\frac{\pi}{2} - 2 \sum_{k=1}^{N/2} \frac{(-1)^{k-1}}{2k-1} \sim \sum_{m=0}^{\infty} \frac{E_{2m}}{N^{2m+1}}\!

where $N$ is an integer divisible by 4. If $N$ is chosen to be a power of ten, each term in the right sum becomes a finite decimal fraction. The formula is a special case of the Boole summation formula for alternating series, providing yet another example of a convergence acceleration technique that can be applied to the Leibniz series. In 1992, Jonathan Borwein and Mark Limber used the first thousand Euler numbers to calculate $π$ to 5,263 decimal places with the Leibniz formula.

Euler product

The Leibniz formula can be interpreted as a Dirichlet series using the (unique) Dirichlet character modulo 4. As with other Dirichlet series, this allows the infinite sum to be converted to an infinite product with one term for each prime number. Such a product is called an Euler product. It is:

\pi/4=\left(\prod_{p\equiv 1\pmod 4}\frac{p}{p-1}\right)\cdot\left( \prod_{p\equiv 3\pmod 4}\frac{p}{p+1}\right)=\frac{3}{4} \cdot \frac{5}{4} \cdot \frac{7}{8} \cdot \frac{11}{12} \cdot \frac{13}{12}\cdot\frac{17}{16} \cdots

In this product, each term is a superparticular ratio, each numerator is an odd prime number, and each denominator is the nearest multiple of four to the numerator.^[3]

Notes

↑ George E. Andrews, Richard Askey, Ranjan Roy (1999), Special Functions, Cambridge University Press, p. 58, ISBN 0-521-78988-5
↑ Leibniz's formula for Pi, proofwiki.org
↑ Debnath, Lokenath (2010), The Legacy of Leonhard Euler: A Tricentennial Tribute, World Scientific, p. 214, ISBN 9781848165267 .

References

Jonathan Borwein, David Bailey & Roland Girgensohn, Experimentation in Mathematics - Computational Paths to Discovery, A K Peters 2003, ISBN 1-56881-136-5, pages 28–30.

External links

Leibniz Formula in C, x86 FPU Assembly, x86-64 SSE3 Assembly, and DEC Alpha Assembly

This article is issued from Wikipedia - version of the Sunday, February 14, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.