Pi

Template:About Template:Use dmy dates Template:Pi box The number Template:Pi is a mathematical constant, the ratio of a circle's circumference to its diameter, commonly approximated as 3.14159. It has been represented by the Greek letter "Template:Pi" since the mid-18th century, though it is also sometimes spelled out as "pi" (Template:IPAc-en).

Being an irrational number, Template:Pi cannot be expressed exactly as a fraction (equivalently, its decimal representation never ends and never settles into a permanent repeating pattern). Still, fractions such as 22/7 and other rational numbers are commonly used to approximate Template:Pi. The digits appear to be randomly distributed; however, to date, no proof of this has been discovered. Also, Template:Pi is a transcendental number – a number that is not the root of any non-zero polynomial having rational coefficients. This transcendence of Template:Pi implies that it is impossible to solve the ancient challenge of squaring the circle with a compass and straightedge.

Ancient civilizations needed the value of Template:Pi to be computed accurately for practical reasons. It was calculated to seven digits, using geometrical techniques, in Chinese mathematics and to about five in Indian mathematics in the 5th century CE. The historically first exact formula for Template:Pi, based on infinite series, was not available until a millennium later, when in the 14th century the Madhava–Leibniz series was discovered in Indian mathematics. In the 20th and 21st centuries, mathematicians and computer scientists discovered new approaches that, when combined with increasing computational power, extended the decimal representation of Template:Pi to, as of 2015, over 13.3 trillion (10¹³) digits. Practically all scientific applications require no more than a few hundred digits of Template:PiTemplate:Discuss, and many substantially fewer, so the primary motivation for these computations is the human desire to break records. However, the extensive calculations involved have been used to test supercomputers and high-precision multiplication algorithms.

Because its definition relates to the circle, Template:Pi is found in many formulae in trigonometry and geometry, especially those concerning circles, ellipses or spheres. It is also found in formulae used in other branches of science such as cosmology, number theory, statistics, fractals, thermodynamics, mechanics and electromagnetism. The ubiquity of Template:Pi makes it one of the most widely known mathematical constants both inside and outside the scientific community: Several books devoted to it have been published, the number is celebrated on Pi Day and record-setting calculations of the digits of Template:Pi often result in news headlines. Attempts to memorize the value of Template:Pi with increasing precision have led to records of over 67,000 digits.

Fundamentals

Name

The symbol used by mathematicians to represent the ratio of a circle's circumference to its diameter is the lowercase [[Pi (letter)|Greek letter Template:Pi]], sometimes spelled out as pi, and derived from the first letter of the Geek word perimetros, meaning circumference. In English, Template:Pi is pronounced as "pie" ( Template:IPAc-en, Template:Respell). In mathematical use, the lowercase letter Template:Pi (or π in sans-serif font) is distinguished from its capital counterpart Template:PI, which denotes a product of a sequence.

The choice of the symbol Template:Pi is discussed in the section [[#Adoption of the symbol π|Adoption of the symbol Template:Pi]].

Definition

ssssssssssssssssssssssssssssssssssssssssssssss

Template:Pi is commonly defined as the ratio of a circle's circumference Template:MATH to its diameter Template:MATH:

$\pi =\frac{C}{d}$

The ratio Template:MATH is constant, regardless of the circle's size. For example, if a circle has twice the diameter of another circle it will also have twice the circumference, preserving the ratio Template:MATH. This definition of Template:Pi implicitly makes use of flat (Euclidean) geometry; although the notion of a circle can be extended to any curved (non-Euclidean) geometry, these new circles will no longer satisfy the formula Template:MATH.

Here, the circumference of a circle is the arc length around the perimeter of the circle, a quantity which can be formally defined independently of geometry using limits, a concept in calculus. For example, one may compute directly the arc length of the top half of the unit circle given in Cartesian coordinates by $x^2+y^2=1$, as the integral:

$\pi =\underset{-1}{\overset{1}{\int }}\frac{dx}{\sqrt{1-x^2}}.$

An integral such as this was adopted as the definition of Template:Pi by Karl Weierstrass, who defined it directly as an integral in 1841.

Definitions of Template:Pi such as these that rely on a notion of circumference, and hence implicitly on concepts of the integral calculus, are no longer common in the literature. Template:Harvtxt explains that this is because in many modern treatments of calculus, differential calculus typically precedes integral calculus in the university curriculum, so it is desirable to have a definition of Template:Pi that does not rely on the latter. One such definition, due to Richard Baltzer, and popularized by Edmund Landau, is the following: Template:Pi is twice the smallest positive number at which the cosine function equals 0. The cosine can be defined independently of geometry as a power series, or as the solution of a differential equation.

In a similar spirit, Template:Pi can be defined instead using properties of the complex exponential, Template:MATH, of a complex variable Template:MATH. Like the cosine, the complex exponential can be defined in one of several ways. The set of complex numbers at which Template:MATH is equal to one is then an (imaginary) arithmetic progression of the form:

$\{\dots ,-2\pi i,0,2\pi i,4\pi i,\dots \}=\{2\pi ki|k\in \mathbb{Z}\}$

and there is a unique positive real number Template:Pi with this property. A more abstract variation on the same idea, making use of sophisticated mathematical concepts of topology and algebra, is the following theorem: there is a unique continuous isomorphism from the group $ℝ/\mathbb{Z}$ of real numbers under addition modulo integers (the circle group) onto the multiplicative group of complex numbers of absolute value one. The number Template:Pi is then defined as half the magnitude of the derivative of this homomorphism.

Properties

Template:Pi is an irrational number, meaning that it cannot be written as the ratio of two integers (fractions such as Template:MATH are commonly used to approximate Template:Pi; no common fraction (ratio of whole numbers) can be its exact value). Because Template:Pi is irrational, it has an infinite number of digits in its decimal representation, and it does not settle into an infinitely repeating pattern of digits. There are several [[proof that π is irrational|proofs that Template:Pi is irrational]]; they generally require calculus and rely on the reductio ad absurdum technique. The degree to which Template:Pi can be approximated by rational numbers (called the irrationality measure) is not precisely known; estimates have established that the irrationality measure is larger than the measure of Template:MATH or Template:MATH but smaller than the measure of Liouville numbers.

Because Template:Pi is a transcendental number, squaring the circle is not possible in a finite number of steps using the classical tools of compass and straightedge.

More strongly, Template:Pi is a transcendental number, which means that it is not the solution of any non-constant polynomial with rational coefficients, such as Template:MATH.

The transcendence of Template:Pi has two important consequences: First, Template:Pi cannot be expressed using any finite combination of rational numbers and square roots or n-th roots such as Template:MATH or Template:MATH. Second, since no transcendental number can be constructed with compass and straightedge, it is not possible to "square the circle". In other words, it is impossible to construct, using compass and straightedge alone, a square whose area is equal to the area of a given circle. Squaring a circle was one of the important geometry problems of the classical antiquity. Amateur mathematicians in modern times have sometimes attempted to square the circle and sometimes claim success despite the fact that it is impossible.

The digits of Template:Pi have no apparent pattern and have passed tests for statistical randomness, including tests for normality; a number of infinite length is called normal when all possible sequences of digits (of any given length) appear equally often. The conjecture that Template:Pi is normal has not been proven or disproven. Since the advent of computers, a large number of digits of Template:Pi have been available on which to perform statistical analysis. Yasumasa Kanada has performed detailed statistical analyses on the decimal digits of Template:Pi and found them consistent with normality; for example, the frequency of the ten digits 0 to 9 were subjected to statistical significance tests, and no evidence of a pattern was found. Despite the fact that Template:Pi's digits pass statistical tests for randomness, Template:Pi contains some sequences of digits that may appear non-random to non-mathematicians, such as a sequence of six consecutive 9s that begins at the 762nd decimal place of the decimal representation of Template:Pi.

Continued fractions

The constant Template:Pi is represented in this mosaic outside the Mathematics Building at the Technical University of Berlin.

Like all irrational numbers, Template:Pi cannot be represented as a common fraction (also known as a simple or vulgar fraction), by the very definition of "irrational". But every irrational number, including Template:Pi, can be represented by an infinite series of nested fractions, called a continued fraction:

$\pi =3+\frac{1}{7+\frac{1}{15+\frac{1}{1+\frac{1}{292+\frac{1}{1+\frac{1}{1+\frac{1}{1+\ddots }}}}}}}$

Truncating the continued fraction at any point yields a rational approximation for Template:Pi; the first four of these are 3, 22/7, 333/106, and 355/113. These numbers are among the most well-known and widely used historical approximations of the constant. Each approximation generated in this way is a best rational approximation; that is, each is closer to Template:Pi than any other fraction with the same or a smaller denominator. Because Template:Pi is known to be transcendental, it is by definition not algebraic and so cannot be a quadratic irrational. Therefore, Template:Pi cannot have a periodic continued fraction. Although the simple continued fraction for Template:Pi (shown above) also does not exhibit any other obvious pattern, mathematicians have discovered several generalized continued fractions that do, such as:

$\pi =\frac{4}{1+\frac{1^2}{2+\frac{3^2}{2+\frac{5^2}{2+\frac{7^2}{2+\frac{9^2}{2+\ddots }}}}}}=3+\frac{1^2}{6+\frac{3^2}{6+\frac{5^2}{6+\frac{7^2}{6+\frac{9^2}{6+\ddots }}}}}=\frac{4}{1+\frac{1^2}{3+\frac{2^2}{5+\frac{3^2}{7+\frac{4^2}{9+\ddots }}}}}$

Approximate value

Some approximations of pi include:

• Integers: 3
• Fractions: Approximate fractions include (in order of increasing accuracy) Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:Sfrac, and Template:Sfrac. (List is selected terms from Template:OEIS2C and Template:OEIS2C.)
• Decimal: The first 50 decimal digits are Template:Gaps Template:OEIS2C
• Binary: The base 2 approximation to 48 digits is Template:Gaps
• Hexadecimal: The base 16 approximation to 20 digits is Template:Gaps
• Sexagesimal: A base 60 approximation to five sexagesimal digits is 3;8,29,44,0,47

History

Antiquity

The best known approximations to Template:Pi dating before the Common Era were accurate to two decimal places; this was improved upon in Chinese mathematics in particular by the mid first millennium, to an accuracy of seven decimal places. After this, no further progress was made until the late medieval period.

Some Egyptologists have claimed that the ancient Egyptians used an approximation of Template:Pi as Template:Sfrac from as early as the Old Kingdom. This claim has met with skepticism.

The earliest written approximations of Template:Pi are found in Egypt and Babylon, both within one percent of the true value. In Babylon, a clay tablet dated 1900–1600 BC has a geometrical statement that, by implication, treats Template:Pi as Template:Sfrac = 3.1250. In Egypt, the Rhind Papyrus, dated around 1650 BC but copied from a document dated to 1850 BC, has a formula for the area of a circle that treats Template:Pi as (Template:Sfrac)² ≈ 3.1605.

Astronomical calculations in the Shatapatha Brahmana (ca. 4th century BC) use a fractional approximation of Template:Sfrac ≈ 3.139 (an accuracy of 9×10⁻⁴). Other Indian sources by about 150 BC treat Template:Pi as Template:Math. ≈ 3.1622

Polygon approximation era

Template:Pi can be estimated by computing the perimeters of circumscribed and inscribed polygons.

The first recorded algorithm for rigorously calculating the value of Template:Pi was a geometrical approach using polygons, devised around 250 BC by the Greek mathematician Archimedes. This polygonal algorithm dominated for over 1,000 years, and as a result Template:Pi is sometimes referred to as "Archimedes' constant". Archimedes computed upper and lower bounds of Template:Pi by drawing a regular hexagon inside and outside a circle, and successively doubling the number of sides until he reached a 96-sided regular polygon. By calculating the perimeters of these polygons, he proved that Template:MATH (that is Template:MATH). Archimedes' upper bound of Template:MATH may have led to a widespread popular belief that Template:Pi is equal to Template:MATH. Around 150 AD, Greek-Roman scientist Ptolemy, in his Almagest, gave a value for Template:Pi of 3.1416, which he may have obtained from Archimedes or from Apollonius of Perga. Mathematicians using polygonal algorithms reached 39 digits of Template:Pi in 1630, a record only broken in 1699 when infinite series were used to reach 71 digits.

Archimedes developed the polygonal approach to approximating Template:Pi.

In ancient China, values for Template:Pi included 3.1547 (around 1 AD), Template:MATH (100 AD, approximately 3.1623), and Template:MATH (3rd century, approximately 3.1556). Around 265 AD, the Wei Kingdom mathematician Liu Hui created a polygon-based iterative algorithm and used it with a 3,072-sided polygon to obtain a value of Template:Pi of 3.1416. Liu later invented a faster method of calculating Template:Pi and obtained a value of 3.14 with a 96-sided polygon, by taking advantage of the fact that the differences in area of successive polygons form a geometric series with a factor of 4. The Chinese mathematician Zu Chongzhi, around 480 AD, calculated that Template:MATH (a fraction that goes by the name Milü in Chinese), using Liu Hui's algorithm applied to a 12,288-sided polygon. With a correct value for its seven first decimal digits, this value of 3.141592920... remained the most accurate approximation of Template:Pi available for the next 800 years.

The Indian astronomer Aryabhata used a value of 3.1416 in his Āryabhaṭīya (499 AD). Fibonacci in c. 1220 computed 3.1418 using a polygonal method, independent of Archimedes. Italian author Dante apparently employed the value Template:MATH.

The Persian astronomer Jamshīd al-Kāshī produced 9 sexagesimal digits, roughly the equivalent of 16 decimal digits, in 1424 using a polygon with 3×2²⁸ sides, which stood as the world record for about 180 years. French mathematician François Viète in 1579 achieved 9 digits with a polygon of 3×2¹⁷ sides. Flemish mathematician Adriaan van Roomen arrived at 15 decimal places in 1593. In 1596, Dutch mathematician Ludolph van Ceulen reached 20 digits, a record he later increased to 35 digits (as a result, Template:Pi was called the "Ludolphian number" in Germany until the early 20th century). Dutch scientist Willebrord Snellius reached 34 digits in 1621, and Austrian astronomer Christoph Grienberger arrived at 38 digits in 1630 using 10⁴⁰ sides, which remains the most accurate approximation manually achieved using polygonal algorithms.

Infinite series

Template:Comparison pi infinite series.svg The calculation of Template:Pi was revolutionized by the development of infinite series techniques in the 16th and 17th centuries. An infinite series is the sum of the terms of an infinite sequence. Infinite series allowed mathematicians to compute Template:Pi with much greater precision than Archimedes and others who used geometrical techniques. Although infinite series were exploited for Template:Pi most notably by European mathematicians such as James Gregory and Gottfried Wilhelm Leibniz, the approach was first discovered in India sometime between 1400 and 1500 AD. The first written description of an infinite series that could be used to compute Template:Pi was laid out in Sanskrit verse by Indian astronomer Nilakantha Somayaji in his Tantrasamgraha, around 1500 AD. The series are presented without proof, but proofs are presented in a later Indian work, Yuktibhāṣā, from around 1530 AD. Nilakantha attributes the series to an earlier Indian mathematician, Madhava of Sangamagrama, who lived c. 1350 – c. 1425. Several infinite series are described, including series for sine, tangent, and cosine, which are now referred to as the Madhava series or Gregory–Leibniz series. Madhava used infinite series to estimate Template:Pi to 11 digits around 1400, but that value was improved on around 1430 by the Persian mathematician Jamshīd al-Kāshī, using a polygonal algorithm.

Isaac Newton used infinite series to compute Template:Pi to 15 digits, later writing "I am ashamed to tell you to how many figures I carried these computations".

The first infinite sequence discovered in Europe was an infinite product (rather than an infinite sum, which are more typically used in Template:Pi calculations) found by French mathematician François Viète in 1593:

$\frac{2}{\pi }=\frac{\sqrt{2}}{2}\cdot \frac{\sqrt{2+\sqrt{2}}}{2}\cdot \frac{\sqrt{2+\sqrt{2+\sqrt{2}}}}{2}\cdots$ Template:OEIS2C

The second infinite sequence found in Europe, by John Wallis in 1655, was also an infinite product. The discovery of calculus, by English scientist Isaac Newton and German mathematician Gottfried Wilhelm Leibniz in the 1660s, led to the development of many infinite series for approximating Template:Pi. Newton himself used an arcsin series to compute a 15 digit approximation of Template:Pi in 1665 or 1666, later writing "I am ashamed to tell you to how many figures I carried these computations, having no other business at the time."

In Europe, Madhava's formula was rediscovered by Scottish mathematician James Gregory in 1671, and by Leibniz in 1674:

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

This formula, the Gregory–Leibniz series, equals Template:MATH when evaluated with Template:MATH = 1. In 1699, English mathematician Abraham Sharp used the Gregory–Leibniz series to compute Template:Pi to 71 digits, breaking the previous record of 39 digits, which was set with a polygonal algorithm. The Gregory–Leibniz series is simple, but converges very slowly (that is, approaches the answer gradually), so it is not used in modern Template:Pi calculations.

In 1706 John Machin used the Gregory–Leibniz series to produce an algorithm that converged much faster:

$\frac{\pi }{4}=4\arctan \frac{1}{5}-\arctan \frac{1}{239}$

Machin reached 100 digits of Template:Pi with this formula. Other mathematicians created variants, now known as Machin-like formulae, that were used to set several successive records for calculating digits of Template:Pi. Machin-like formulae remained the best-known method for calculating Template:Pi well into the age of computers, and were used to set records for 250 years, culminating in a 620-digit approximation in 1946 by Daniel Ferguson – the best approximation achieved without the aid of a calculating device.

A record was set by the calculating prodigy Zacharias Dase, who in 1844 employed a Machin-like formula to calculate 200 decimals of Template:Pi in his head at the behest of German mathematician Carl Friedrich Gauss. British mathematician William Shanks famously took 15 years to calculate Template:Pi to 707 digits, but made a mistake in the 528th digit, rendering all subsequent digits incorrect.

Rate of convergence

Some infinite series for Template:Pi converge faster than others. Given the choice of two infinite series for Template:Pi, mathematicians will generally use the one that converges more rapidly because faster convergence reduces the amount of computation needed to calculate Template:Pi to any given accuracy. A simple infinite series for Template:Pi is the Gregory–Leibniz series:

$\pi =\frac{4}{1}-\frac{4}{3}+\frac{4}{5}-\frac{4}{7}+\frac{4}{9}-\frac{4}{11}+\frac{4}{13}-\cdots$

As individual terms of this infinite series are added to the sum, the total gradually gets closer to Template:Pi, and – with a sufficient number of terms – can get as close to Template:Pi as desired. It converges quite slowly, though – after 500,000 terms, it produces only five correct decimal digits of Template:Pi.

An infinite series for Template:Pi (published by Nilakantha in the 15th century) that converges more rapidly than the Gregory–Leibniz series is:

$\pi =3+\frac{4}{2\times 3\times 4}-\frac{4}{4\times 5\times 6}+\frac{4}{6\times 7\times 8}-\frac{4}{8\times 9\times 10}+\cdots$

The following table compares the convergence rates of these two series:

Infinite series for Template:Pi	After 1st term	After 2nd term	After 3rd term	After 4th term	After 5th term	Converges to:
$\pi =\frac{4}{1}-\frac{4}{3}+\frac{4}{5}-\frac{4}{7}+\frac{4}{9}-\frac{4}{11}+\frac{4}{13}\cdots .$	4.0000	2.6666...	3.4666...	2.8952...	3.3396...	Template:Pi = 3.1415...
$\pi =3+\frac{4}{2\times 3\times 4}-\frac{4}{4\times 5\times 6}+\frac{4}{6\times 7\times 8}\cdots .$	3.0000	3.1666...	3.1333...	3.1452...	3.1396...

After five terms, the sum of the Gregory–Leibniz series is within 0.2 of the correct value of Template:Pi, whereas the sum of Nilakantha's series is within 0.002 of the correct value of Template:Pi. Nilakantha's series converges faster and is more useful for computing digits of Template:Pi. Series that converge even faster include Machin's series and Chudnovsky's series, the latter producing 14 correct decimal digits per term.

Irrationality and transcendence

Template:See also Not all mathematical advances relating to Template:Pi were aimed at increasing the accuracy of approximations. When Euler solved the Basel problem in 1735, finding the exact value of the sum of the reciprocal squares, he established a connection between Template:Pi and the prime numbers that later contributed to the development and study of the Riemann zeta function:

$\frac{{\pi }^2}{6}=\frac{1}{1^2}+\frac{1}{2^2}+\frac{1}{3^2}+\frac{1}{4^2}+\cdots$

Swiss scientist Johann Heinrich Lambert in 1761 proved that Template:Pi is irrational, meaning it is not equal to the quotient of any two whole numbers. Lambert's proof exploited a continued-fraction representation of the tangent function. French mathematician Adrien-Marie Legendre proved in 1794 that Template:Pi² is also irrational. In 1882, German mathematician Ferdinand von Lindemann proved that Template:Pi is transcendental, confirming a conjecture made by both Legendre and Euler. Hardy and Wright states that "the proofs were afterwards modified and simplified by Hilbert, Hurwitz, and other writers".

Adoption of the symbol Template:Pi

Leonhard Euler popularized the use of the Greek letter Template:Pi in works he published in 1736 and 1748.

The earliest known use of the Greek letter Template:Pi to represent the ratio of a circle's circumference to its diameter was by Welsh mathematician William Jones in his 1706 work Synopsis Palmariorum Matheseos; or, a New Introduction to the Mathematics. The Greek letter first appears there in the phrase "1/2 Periphery (Template:Pi)" in the discussion of a circle with radius one. Jones may have chosen Template:Pi because it was the first letter in the Greek spelling of the word periphery. However, he writes that his equations for Template:Pi are from the "ready pen of the truly ingenious Mr. John Machin", leading to speculation that Machin may have employed the Greek letter before Jones. It had indeed been used earlier for geometric concepts. William Oughtred used Template:Pi and δ, the Greek letter equivalents of p and d, to express ratios of periphery and diameter in the 1647 and later editions of Clavis Mathematicae.

After Jones introduced the Greek letter in 1706, it was not adopted by other mathematicians until Euler started using it, beginning with his 1736 work Mechanica. Before then, mathematicians sometimes used letters such as c or p instead. Because Euler corresponded heavily with other mathematicians in Europe, the use of the Greek letter spread rapidly. In 1748, Euler used Template:Pi in his widely read work Introductio in analysin infinitorum (he wrote: "for the sake of brevity we will write this number as Template:Pi; thus Template:Pi is equal to half the circumference of a circle of radius 1") and the practice was universally adopted thereafter in the Western world.

Modern quest for more digits

Computer era and iterative algorithms

John von Neumann was part of the team that first used a digital computer, ENIAC, to compute Template:Pi.

The development of computers in the mid-20th century again revolutionized the hunt for digits of Template:Pi. American mathematicians John Wrench and Levi Smith reached 1,120 digits in 1949 using a desk calculator. Using an inverse tangent (arctan) infinite series, a team led by George Reitwiesner and John von Neumann that same year achieved 2,037 digits with a calculation that took 70 hours of computer time on the ENIAC computer. The record, always relying on an arctan series, was broken repeatedly (7,480 digits in 1957; 10,000 digits in 1958; 100,000 digits in 1961) until 1 million digits were reached in 1973.

Two additional developments around 1980 once again accelerated the ability to compute Template:Pi. First, the discovery of new iterative algorithms for computing Template:Pi, which were much faster than the infinite series; and second, the invention of fast multiplication algorithms that could multiply large numbers very rapidly. Such algorithms are particularly important in modern Template:Pi computations, because most of the computer's time is devoted to multiplication. They include the Karatsuba algorithm, Toom–Cook multiplication, and Fourier transform-based methods.

The iterative algorithms were independently published in 1975–1976 by American physicist Eugene Salamin and Australian scientist Richard Brent. These avoid reliance on infinite series. An iterative algorithm repeats a specific calculation, each iteration using the outputs from prior steps as its inputs, and produces a result in each step that converges to the desired value. The approach was actually invented over 160 years earlier by Carl Friedrich Gauss, in what is now termed the arithmetic–geometric mean method (AGM method) or Gauss–Legendre algorithm. As modified by Salamin and Brent, it is also referred to as the Brent–Salamin algorithm.

The iterative algorithms were widely used after 1980 because they are faster than infinite series algorithms: whereas infinite series typically increase the number of correct digits additively in successive terms, iterative algorithms generally multiply the number of correct digits at each step. For example, the Brent-Salamin algorithm doubles the number of digits in each iteration. In 1984, the Canadian brothers John and Peter Borwein produced an iterative algorithm that quadruples the number of digits in each step; and in 1987, one that increases the number of digits five times in each step. Iterative methods were used by Japanese mathematician Yasumasa Kanada to set several records for computing Template:Pi between 1995 and 2002. This rapid convergence comes at a price: the iterative algorithms require significantly more memory than infinite series.

Motivations for computing Template:Pi

As mathematicians discovered new algorithms, and computers became available, the number of known decimal digits of Template:Pi increased dramatically. Note that the vertical scale is logarithmic.

For most numerical calculations involving Template:Pi, a handful of digits provide sufficient precision. According to Jörg Arndt and Christoph Haenel, thirty-nine digits are sufficient to perform most cosmological calculations, because that is the accuracy necessary to calculate the circumference of the observable universe with a precision of one atom. Despite this, people have worked strenuously to compute Template:Pi to thousands and millions of digits. This effort may be partly ascribed to the human compulsion to break records, and such achievements with Template:Pi often make headlines around the world. They also have practical benefits, such as testing supercomputers, testing numerical analysis algorithms (including high-precision multiplication algorithms); and within pure mathematics itself, providing data for evaluating the randomness of the digits of Template:Pi.

Rapidly convergent series

Srinivasa Ramanujan, working in isolation in India, produced many innovative series for computing Template:Pi.

Modern Template:Pi calculators do not use iterative algorithms exclusively. New infinite series were discovered in the 1980s and 1990s that are as fast as iterative algorithms, yet are simpler and less memory intensive. The fast iterative algorithms were anticipated in 1914, when the Indian mathematician Srinivasa Ramanujan published dozens of innovative new formulae for Template:Pi, remarkable for their elegance, mathematical depth, and rapid convergence. One of his formulae, based on modular equations, is

$\frac{1}{\pi }=\frac{2\sqrt{2}}{9801}\sum _{k=0}^{\mathrm{\infty }}\frac{(4k)!(1103+26390k)}{k{!}^4(396^{4k})}.$

This series converges much more rapidly than most arctan series, including Machin's formula. Bill Gosper was the first to use it for advances in the calculation of Template:Pi, setting a record of 17 million digits in 1985. Ramanujan's formulae anticipated the modern algorithms developed by the Borwein brothers and the Chudnovsky brothers. The Chudnovsky formula developed in 1987 is

$\frac{1}{\pi }=\frac{12}{640320^{3/2}}\sum _{k=0}^{\mathrm{\infty }}\frac{(6k)!(13591409+545140134k)}{(3k)!(k!{)}^3(-640320{)}^{3k}}.$

It produces about 14 digits of Template:Pi per term, and has been used for several record-setting Template:Pi calculations, including the first to surpass 1 billion (10⁹) digits in 1989 by the Chudnovsky brothers, 2.7 trillion (2.7×10¹²) digits by Fabrice Bellard in 2009, and 10 trillion (10¹³) digits in 2011 by Alexander Yee and Shigeru Kondo. For similar formulas, see also the Ramanujan–Sato series.

In 2006, Canadian mathematician Simon Plouffe used the PSLQ integer relation algorithm to generate several new formulas for Template:Pi, conforming to the following template:

${\pi }^k=\sum _{n=1}^{\mathrm{\infty }}\frac{1}{n^k}(\frac{a}{q^n-1}+\frac{b}{q^{2n}-1}+\frac{c}{q^{4n}-1}),$

where Template:Math. is [[Gelfond's constant|Template:Math.^Template:Pi]] (Gelfond's constant), Template:Math. is an odd number, and Template:Math. are certain rational numbers that Plouffe computed.

Spigot algorithms

Two algorithms were discovered in 1995 that opened up new avenues of research into Template:Pi. They are called spigot algorithms because, like water dripping from a spigot, they produce single digits of Template:Pi that are not reused after they are calculated. This is in contrast to infinite series or iterative algorithms, which retain and use all intermediate digits until the final result is produced.

American mathematicians Stan Wagon and Stanley Rabinowitz produced a simple spigot algorithm in 1995. Its speed is comparable to arctan algorithms, but not as fast as iterative algorithms.

Another spigot algorithm, the BBP digit extraction algorithm, was discovered in 1995 by Simon Plouffe:

$\pi =\sum _{k=0}^{\mathrm{\infty }}\frac{1}{16^k}(\frac{4}{8k+1}-\frac{2}{8k+4}-\frac{1}{8k+5}-\frac{1}{8k+6})$

This formula, unlike others before it, can produce any individual hexadecimal digit of Template:Pi without calculating all the preceding digits. Individual binary digits may be extracted from individual hexadecimal digits, and octal digits can be extracted from one or two hexadecimal digits. Variations of the algorithm have been discovered, but no digit extraction algorithm has yet been found that rapidly produces decimal digits. An important application of digit extraction algorithms is to validate new claims of record Template:Pi computations: After a new record is claimed, the decimal result is converted to hexadecimal, and then a digit extraction algorithm is used to calculate several random hexadecimal digits near the end; if they match, this provides a measure of confidence that the entire computation is correct.

Between 1998 and 2000, the distributed computing project PiHex used Bellard's formula (a modification of the BBP algorithm) to compute the quadrillionth (10¹⁵th) bit of Template:Pi, which turned out to be 0. In September 2010, a Yahoo! employee used the company's Hadoop application on one thousand computers over a 23-day period to compute 256 bits of Template:Pi at the two-quadrillionth (2×10¹⁵th) bit, which also happens to be zero.

Use

Template:Main Because Template:Pi is closely related to the circle, it is found in many formulae from the fields of geometry and trigonometry, particularly those concerning circles, spheres, or ellipses. Formulae from other branches of science also include Template:Pi in some of their important formulae, including sciences such as statistics, fractals, thermodynamics, mechanics, cosmology, number theory, and electromagnetism.

Geometry and trigonometry

The area of the circle equals Template:Pi times the shaded area.

Template:Pi appears in formulae for areas and volumes of geometrical shapes based on circles, such as ellipses, spheres, cones, and tori. Below are some of the more common formulae that involve Template:Pi.

• The circumference of a circle with radius Template:Math. is Template:Math..
• The area of a circle with radius Template:Math. is Template:Math..
• The volume of a sphere with radius Template:Math. is Template:Math..
• The surface area of a sphere with radius Template:Math. is Template:Math..

The formulae above are special cases of the surface area Template:Math. and volume Template:Math. of an n-dimensional sphere.

$S_n(r)=\frac{n{\pi }^{n/2}}{\mathrm{\Gamma }(\frac{n}{2}+1)}{r}^{n-1}$

$V_n(r)=\frac{{\pi }^{n/2}}{\mathrm{\Gamma }(\frac{n}{2}+1)}{r}^n$

Template:Pi appears in definite integrals that describe circumference, area, or volume of shapes generated by circles. For example, an integral that specifies half the area of a circle of radius one is given by:

$\underset{-1}{\overset{1}{\int }}\sqrt{1-x^2}dx=\frac{\pi }{2}.$

In that integral the function Template:Math. represents the top half of a circle (the square root is a consequence of the Pythagorean theorem), and the integral Template:Math. computes the area between that half of a circle and the [[X axis|Template:Math. axis]].

Sine and cosine functions repeat with period 2Template:Pi.

The trigonometric functions rely on angles, and mathematicians generally use radians as units of measurement. Template:Pi plays an important role in angles measured in radians, which are defined so that a complete circle spans an angle of 2Template:Pi radians. The angle measure of 180° is equal to Template:Pi radians, and 1° = Template:Pi/180 radians.

Common trigonometric functions have periods that are multiples of Template:Pi; for example, sine and cosine have period 2Template:Pi, so for any angle Template:Math. and any integer Template:Math.,

$\sin \theta =\sin (\theta +2\pi k)\text{ and }\cos \theta =\cos (\theta +2\pi k).$

Monte Carlo methods

Template:Multiple image Monte Carlo methods, which evaluate the results of multiple random trials, can be used to create approximations of Template:Pi. Buffon's needle is one such technique: If a needle of length Template:Math. is dropped Template:Math. times on a surface on which parallel lines are drawn Template:Math. units apart, and if Template:Math. of those times it comes to rest crossing a line (Template:Math. > 0), then one may approximate Template:Pi based on the counts:

$\pi \approx \frac{2n\ell }{xt}$

Another Monte Carlo method for computing Template:Pi is to draw a circle inscribed in a square, and randomly place dots in the square. The ratio of dots inside the circle to the total number of dots will approximately equal Template:Math..

Monte Carlo methods for approximating Template:Pi are very slow compared to other methods, and are never used to approximate Template:Pi when speed or accuracy is desired.

Complex numbers and analysis

The association between imaginary powers of the number Template:Math. and points on the unit circle centered at the origin in the complex plane given by Euler's formula.

Any complex number, say Template:Math., can be expressed using a pair of real numbers. In the polar coordinate system, one number (radius or r) is used to represent Template:Math.'s distance from the origin of the complex plane and the other (angle or Template:Math.) to represent a counter-clockwise rotation from the positive real line as follows:

$z=r\cdot (\cos \phi +i\sin \phi ),$

where Template:Math. is the imaginary unit satisfying Template:Math. = −1. The frequent appearance of Template:Pi in complex analysis can be related to the behavior of the exponential function of a complex variable, described by Euler's formula:

$e^{i\phi }=\cos \phi +i\sin \phi ,$

where [[E (mathematical constant)|the constant Template:Math.]] is the base of the natural logarithm. This formula establishes a correspondence between imaginary powers of Template:Math. and points on the unit circle centered at the origin of the complex plane. Setting Template:Math. = Template:Pi in Euler's formula results in Euler's identity, celebrated by mathematicians because it contains the five most important mathematical constants:

$e^{i\pi }+1=0.$

There are Template:Math. different complex numbers Template:Math. satisfying Template:Math., and these are called the "Template:Math.-th roots of unity". They are given by this formula:

$e^{2\pi ik/n}(k=0,1,2,\dots ,n-1).$

Cauchy's integral formula governs complex analytic functions and establishes an important relationship between integration and differentiation, including the fact that the values of a complex function within a closed boundary are entirely determined by the values on the boundary:

$f(z_0)=\frac{1}{2\pi i}{\oint }_{\gamma }\frac{f(z)}{z-z_0}dz$

Template:Pi can be computed from the Mandelbrot set, by counting the number of iterations required before point (−0.75, ε) diverges.

An occurrence of Template:Pi in the Mandelbrot set fractal was discovered by American David Boll in 1991. He examined the behavior of the Mandelbrot set near the "neck" at (−0.75, 0). If points with coordinates (−0.75, ε) are considered, as ε tends to zero, the number of iterations until divergence for the point multiplied by ε converges to Template:Pi. The point (0.25, ε) at the cusp of the large "valley" on the right side of the Mandelbrot set behaves similarly: the number of iterations until divergence multiplied by the square root of ε tends to Template:Pi.

The gamma function extends the concept of factorial (normally defined only for non-negative integers) to all complex numbers, except the negative real integers. When the gamma function is evaluated at half-integers, the result contains Template:Pi; for example $\mathrm{\Gamma }(1/2)=\sqrt{\pi }$ and $\mathrm{\Gamma }(5/2)=\frac{3\sqrt{\pi }}{4}$. The gamma function can be used to create a simple approximation to Template:Math. for large Template:Math.: $n!\sim \sqrt{2\pi n}{\left(\frac{n}{e}\right)}^n$ which is known as Stirling's approximation.

Number theory and Riemann zeta function

The Riemann zeta function Template:Math. is used in many areas of mathematics. When evaluated at Template:Math. it can be written as

$\zeta (2)=\frac{1}{1^2}+\frac{1}{2^2}+\frac{1}{3^2}+\cdots$

Finding a simple solution for this infinite series was a famous problem in mathematics called the Basel problem. Leonhard Euler solved it in 1735 when he showed it was equal to Template:Math.. Euler's result leads to the number theory result that the probability of two random numbers being relatively prime (that is, having no shared factors) is equal to Template:Math.. This probability is based on the observation that the probability that any number is divisible by a prime Template:Math. is Template:Math. (for example, every 7th integer is divisible by 7.) Hence the probability that two numbers are both divisible by this prime is Template:Math., and the probability that at least one of them is not is Template:Math.. For distinct primes, these divisibility events are mutually independent; so the probability that two numbers are relatively prime is given by a product over all primes:

$\prod _p^{\mathrm{\infty }}(1-\frac{1}{p^2})={\left(\prod _p^{\mathrm{\infty }}\frac{1}{1-p^{-2}}\right)}^{-1}=\frac{1}{1+\frac{1}{2^2}+\frac{1}{3^2}+\cdots }=\frac{1}{\zeta (2)}=\frac{6}{{\pi }^2}\approx 61\mathrm{\%}$

This probability can be used in conjunction with a random number generator to approximate Template:Pi using a Monte Carlo approach.

Probability and statistics

A graph of the Gaussian function
ƒ(x) = e^−x2. The colored region between the function and the x-axis has area $\sqrt{\pi }$.

The fields of probability and statistics frequently use the normal distribution as a simple model for complex phenomena; for example, scientists generally assume that the observational error in most experiments follows a normal distribution. Template:Pi is found in the Gaussian function (which is the probability density function of the normal distribution) with mean Template:Math. and standard deviation Template:Math.:

$f(x)=\frac{1}{\sigma \sqrt{2\pi }}{e}^{-(x-\mu {)}^2/(2{\sigma }^2)}$

The area under the graph of the normal distribution curve is given by the Gaussian integral:

$\underset{-\mathrm{\infty }}{\overset{\mathrm{\infty }}{\int }}{e}^{-x^2}dx=\sqrt{\pi },$

while the related integral for the Cauchy distribution is

$\underset{-\mathrm{\infty }}{\overset{\mathrm{\infty }}{\int }}\frac{1}{x^2+1}dx=\pi .$

Outside mathematics

Describing physical phenomena

Although not a physical constant, Template:Pi appears routinely in equations describing fundamental principles of the universe, often because of Template:Pi's relationship to the circle and to spherical coordinate systems. A simple formula from the field of classical mechanics gives the approximate period Template:Math. of a simple pendulum of length Template:Math., swinging with a small amplitude (Template:Math. is the earth's gravitational acceleration):

$T\approx 2\pi \sqrt{\frac{L}{g}}.$

One of the key formulae of quantum mechanics is Heisenberg's uncertainty principle, which shows that the uncertainty in the measurement of a particle's position (ΔTemplate:Math.) and momentum (ΔTemplate:Math.) cannot both be arbitrarily small at the same time (where Template:Math. is Planck's constant):

$\mathrm{\Delta }x\mathrm{\Delta }p\ge \frac{h}{4\pi }.$

In the domain of cosmology, Template:Pi appears in Einstein's field equation, a fundamental formula which forms the basis of the general theory of relativity and describes the fundamental interaction of gravitation as a result of spacetime being curved by matter and energy:

$R_{\mu \nu }-\frac{1}{2}R{g}_{\mu \nu }+\mathrm{\Lambda }{g}_{\mu \nu }=\frac{8\pi G}{c^4}{T}_{\mu \nu },$

where $R_{\mu \nu }$ is the Ricci curvature tensor, Template:Math. is the scalar curvature, $g_{\mu \nu }$ is the metric tensor, Template:Math. is the cosmological constant, Template:Math. is Newton's gravitational constant, Template:Math. is the speed of light in vacuum, and $T_{\mu \nu }$ is the stress–energy tensor.

Coulomb's law, from the discipline of electromagnetism, describes the electric field between two electric charges (Template:Math. and Template:Math.) separated by distance Template:Math. (with Template:Math. representing the vacuum permittivity of free space):

$F=\frac{\left|q_1{q}_2\right|}{4\pi {\epsilon }_0{r}^2}.$

The fact that Template:Pi is approximately equal to 3 plays a role in the relatively long lifetime of orthopositronium. The inverse lifetime to lowest order in the fine-structure constant Template:Math. is

$\frac{1}{\tau }=2\frac{{\pi }^2-9}{9\pi }m{\alpha }^6,$

where Template:Math. is the mass of the electron.

Template:Pi is present in some structural engineering formulae, such as the buckling formula derived by Euler, which gives the maximum axial load Template:Math. that a long, slender column of length Template:Math., modulus of elasticity Template:Math., and area moment of inertia Template:Math. can carry without buckling:

$F=\frac{{\pi }^{2}EI}{L^2}.$

The field of fluid dynamics contains Template:Pi in Stokes' law, which approximates the frictional force Template:Math. exerted on small, spherical objects of radius Template:Math., moving with velocity Template:Math. in a fluid with dynamic viscosity Template:Math.:

$F=6\pi \eta Rv.$

The Fourier transform, defined below, is a mathematical operation that expresses time as a function of frequency, known as its frequency spectrum. It has many applications in physics and engineering, particularly in signal processing.

$\hat{f}(\xi )=\underset{-\mathrm{\infty }}{\overset{\mathrm{\infty }}{\int }}f(x)e^{-2\pi ix\xi }dx$

Under ideal conditions (uniform gentle slope on an homogeneously erodible substrate), the sinuosity of a meandering river approaches Template:Pi. The sinuosity is the ratio between the actual length and the straight-line distance from source to mouth. Faster currents along the outside edges of a river's bends cause more erosion than along the inside edges, thus pushing the bends even farther out, and increasing the overall loopiness of the river. However, that loopiness eventually causes the river to double back on itself in places and "short-circuit", creating an ox-bow lake in the process. The balance between these two opposing factors leads to an average ratio of Template:Pi between the actual length and the direct distance between source and mouth.

The Wallis formula for pi can be obtained directly from the variational approach to the spectrum of the hydrogen atom in spaces of arbitrary dimensions greater than one, including the physical three dimensions.

Memorizing digits

Template:Main Many persons have memorized large numbers of digits of Template:Pi, a practice called piphilology. One common technique is to memorize a story or poem in which the word lengths represent the digits of Template:Pi: The first word has three letters, the second word has one, the third has four, the fourth has one, the fifth has five, and so on. An early example of a memorization aid, originally devised by English scientist James Jeans, is "How I want a drink, alcoholic of course, after the heavy lectures involving quantum mechanics." When a poem is used, it is sometimes referred to as a piem. Poems for memorizing Template:Pi have been composed in several languages in addition to English.

The record for memorizing digits of Template:Pi, certified by Guinness World Records, is 70,000 digits, recited in India by Rajveer Meena in 9 hours and 27 minutes on 21 March 2015. In 2006, Akira Haraguchi, a retired Japanese engineer, claimed to have recited 100,000 decimal places, but the claim was not verified by Guinness World Records. Record-setting Template:Pi memorizers typically do not rely on poems, but instead use methods such as remembering number patterns and the method of loci.

A few authors have used the digits of Template:Pi to establish a new form of constrained writing, where the word lengths are required to represent the digits of Template:Pi. The Cadaeic Cadenza contains the first 3835 digits of Template:Pi in this manner, and the full-length book Not a Wake contains 10,000 words, each representing one digit of Template:Pi.

In popular culture

A pi pie. The circular shape of pie makes it a frequent subject of pi puns.

Perhaps because of the simplicity of its definition and its ubiquitous presence in formulae, Template:Pi has been represented in popular culture more than other mathematical constructs.

In the 2008 Open University and BBC documentary co-production, The Story of Maths, aired in October 2008 on BBC Four, British mathematician Marcus du Sautoy shows a visualization of the - historically first exact - [[Madhava of Sangamagrama#The value of π (pi)|formula for calculating Template:Pi]] when visiting India and exploring its contributions to trigonometry.

In the Palais de la Découverte (a science museum in Paris) there is a circular room known as the pi room. On its wall are inscribed 707 digits of Template:Pi. The digits are large wooden characters attached to the dome-like ceiling. The digits were based on an 1853 calculation by English mathematician William Shanks, which included an error beginning at the 528th digit. The error was detected in 1946 and corrected in 1949.

In Carl Sagan's novel Contact it is suggested that the creator of the universe buried a message deep within the digits of Template:Pi. The digits of Template:Pi have also been incorporated into the lyrics of the song "Pi" from the album Aerial by Kate Bush, and a song by Hard 'n Phirm.

Many schools in the United States observe Pi Day on 14 March (written 3/14 in the US style). Template:Pi and its digital representation are often used by self-described "math geeks" for inside jokes among mathematically and technologically minded groups. Several college cheers at the Massachusetts Institute of Technology include "3.14159". Pi Day in 2015 was particularly significant because the date and time 3/14/15 9:26:53 reflected many more digits of pi. Pi Day in 2016 is also significant because the date including the year - 3/14/16 - is the value of pi rounded to 4 decimal places: 3.1416

During the 2011 auction for Nortel's portfolio of valuable technology patents, Google made a series of unusually specific bids based on mathematical and scientific constants, including Template:Pi.

Some formulas using the 2Template:Pi definition of Template:Tau.

Template:Anchor In 1958 Albert Eagle proposed replacing Template:Pi by Template:Tau = Template:Pi/2 to simplify formulas. However, no other authors are known to use Template:Tau in this way. Some people use a different value, Template:Tau = 6.283185... = 2Template:Pi, arguing that Template:Tau, as the number of radians in one turn or as the ratio of a circle's circumference to its radius rather than its diameter, is more natural than Template:Pi and simplifies many formulas. Celebrations of this number, because it approximately equals 6.28, by making 28 June "Tau Day" and eating "twice the pie", have been reported in the media. However this use of Template:Math. has not made its way into mainstream mathematics.

In 1897, an amateur American mathematician attempted to persuade the Indiana legislature to pass the Indiana Pi Bill, which described a method to square the circle and contained text that implied various incorrect values for Template:Pi, including 3.2. The bill is notorious as an attempt to establish a value of scientific constant by legislative fiat. The bill was passed by the Indiana House of Representatives, but rejected by the Senate.

Notes

Footnotes

References

• Template:Cite book English translation by Catriona and David Lischka.
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book, English translation by Stephen Wilson.
• Template:Cite book
• Template:Cite book
• Template:Cite journal
• Template:Cite journal
• Template:Cite journal. issue 3 Jan/Feb, issue 4 Mar/Apr, issue 5 May/Jun

Further reading

• Template:Cite book
• Template:Cite journal
• Template:Cite journal
• Chudnovsky, David V. and Chudnovsky, Gregory V., "Approximations and Complex Multiplication According to Ramanujan", in Ramanujan Revisited (G.E. Andrews et al. Eds), Academic Press, 1988, pp 375–396, 468–472
• Cox, David A., "The Arithmetic-Geometric Mean of Gauss", L' Ensignement Mathematique, 30(1984) 275–330
• Delahaye, Jean-Paul, "Le Fascinant Nombre Pi", Paris: Bibliothèque Pour la Science (1997) ISBN 2902918259
• Template:Cite journal
• Euler, Leonhard, "On the Use of the Discovered Fractions to Sum Infinite Series", in Introduction to Analysis of the Infinite. Book I, translated from the Latin by J. D. Blanton, Springer-Verlag, 1964, pp 137–153
• Hardy, G. H. and Wright E. M., An Introduction to the Theory of Numbers first published 1938, fifth Edition 1979 with additions 2000, Clarendon Press, Oxford U.K.
• Heath, T. L., The Works of Archimedes, Cambridge, 1897; reprinted in The Works of Archimedes with The Method of Archimedes, Dover, 1953, pp 91–98
• Huygens, Christiaan, "De Circuli Magnitudine Inventa", Christiani Hugenii Opera Varia I, Leiden 1724, pp 384–388
• Template:Cite journal
• Template:Cite journal
• Template:Cite journal
• Niven, Ivan, "A Simple Proof that pi Is Irrational", Bulletin of the American Mathematical Society, 53:7 (July 1947), 507
• Ramanujan, Srinivasa, "Modular Equations and Approximations to π", Quarterly Journal of Pure and Applied Mathematics, XLV, 1914, 350–372. Reprinted in G.H. Hardy, P.V. Seshu Aiyar, and B. M. Wilson (eds), Srinivasa Ramanujan: Collected Papers, 1927 (reprinted 2000), pp 23–29
• Shanks, William, Contributions to Mathematics Template:Sic Chiefly of the Rectification of the Circle to 607 Places of Decimals, 1853, pp. i–xvi, 10
• Template:Cite journal
• Tropfke, Johannes, Geschichte Der Elementar-Mathematik in Systematischer Darstellung (The history of elementary mathematics), BiblioBazaar, 2009 (reprint), ISBN 978-1-113-08573-3
• Viete, Francois, Variorum de Rebus Mathematicis Reponsorum Liber VII. F. Viete, Opera Mathematica (reprint), Georg Olms Verlag, 1970, pp 398–401, 436–446
• Wagon, Stan, "Is Pi Normal?", The Mathematical Intelligencer, 7:3(1985) 65–67
• Wallis, John, Arithmetica Infinitorum, sive Nova Methodus Inquirendi in Curvilineorum Quadratum, aliaque difficiliora Matheseos Problemata, Oxford 1655–6. Reprinted in vol. 1 (pp 357–478) of Opera Mathematica, Oxford 1693
• Zebrowski, Ernest, A History of the Circle: Mathematical Reasoning and the Physical Universe, Rutgers University Press, 1999, ISBN 978-0-8135-2898-4

External links

• Template:Dmoz
• "Pi" at Wolfram Mathworld
• Representations of Pi at Wolfram Alpha
• Pi Search Engine: 2 billion searchable digits of Template:Pi, Template:Math., and Template:Math.
• Template:Cite web
• Template:Cite web

• Demonstration by Lambert (1761) of irrationality of Template:Pi, online Template:Webarchive and analyzed BibNum Template:Webarchive (PDF).