Pi Explained

The number (; spelled out as "pi") is a mathematical constant that is the ratio of a circle's circumference to its diameter, approximately equal to 3.14159. The number appears in many formulae across mathematics and physics. It is an irrational number, meaning that it cannot be expressed exactly as a ratio of two integers, although fractions such as

\tfrac{ 22 }{ 7 } are commonly used to approximate it. Consequently, its decimal representation never ends, nor enters a permanently repeating pattern. It is a transcendental number, meaning that it cannot be a solution of an equation involving only finite sums, products, powers, and integers. The transcendence of implies that it is impossible to solve the ancient challenge of squaring the circle with a compass and straightedge. The decimal digits of appear to be randomly distributed, but no proof of this conjecture has been found.

For thousands of years, mathematicians have attempted to extend their understanding of, sometimes by computing its value to a high degree of accuracy. Ancient civilizations, including the Egyptians and Babylonians, required fairly accurate approximations of for practical computations. Around 250BC, the Greek mathematician Archimedes created an algorithm to approximate with arbitrary accuracy. In the 5th century AD, Chinese mathematicians approximated to seven digits, while Indian mathematicians made a five-digit approximation, both using geometrical techniques. The first computational formula for, based on infinite series, was discovered a millennium later.^[1] The earliest known use of the Greek letter π to represent the ratio of a circle's circumference to its diameter was by the Welsh mathematician William Jones in 1706.^[2]

The invention of calculus soon led to the calculation of hundreds of digits of, enough for all practical scientific computations. Nevertheless, in the 20th and 21st centuries, mathematicians and computer scientists have pursued new approaches that, when combined with increasing computational power, extended the decimal representation of to many trillions of digits.^{[3] [4]} These computations are motivated by the development of efficient algorithms to calculate numeric series, as well as the human quest to break records.^[5] The extensive computations involved have also been used to test supercomputers as well as stress testing consumer computer hardware.

Because its definition relates to the circle, is found in many formulae in trigonometry and geometry, especially those concerning circles, ellipses and spheres. It is also found in formulae from other topics in science, such as cosmology, fractals, thermodynamics, mechanics, and electromagnetism. It also appears in areas having little to do with geometry, such as number theory and statistics, and in modern mathematical analysis can be defined without any reference to geometry. The ubiquity of makes it one of the most widely known mathematical constants inside and outside of science. Several books devoted to have been published, and record-setting calculations of the digits of often result in news headlines.

Fundamentals

Name

The symbol used by mathematicians to represent the ratio of a circle's circumference to its diameter is the lowercase Greek letter , sometimes spelled out as pi. In English, is pronounced as "pie" .^[6] In mathematical use, the lowercase letter is distinguished from its capitalized and enlarged counterpart, which denotes a product of a sequence, analogous to how denotes summation.

The choice of the symbol is discussed in the section Adoption of the symbol .

Definition

is commonly defined as the ratio of a circle's circumference to its diameter :$$\backslash pi\; =\; \backslash frac$$

The ratio $\backslash frac$ 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 $\backslash frac$. This definition of implicitly makes use of flat (Euclidean) geometry; although the notion of a circle can be extended to any curve (non-Euclidean) geometry, these new circles will no longer satisfy the formula $\backslash pi=\backslash frac$.

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.^[7] For example, one may directly compute the arc length of the top half of the unit circle, given in Cartesian coordinates by the equation $x^2+y^2=1$, as the integral:$$\backslash pi\; =\; \backslash int\_^1\; \backslash frac.$$

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

Integration is no longer commonly used in a first analytical definition because, as explains, differential calculus typically precedes integral calculus in the university curriculum, so it is desirable to have a definition of that does not rely on the latter. One such definition, due to Richard Baltzer^[8] and popularized by Edmund Landau,^[9] is the following: is twice the smallest positive number at which the cosine function equals 0.^[10] is also the smallest positive number at which the sine function equals zero, and the difference between consecutive zeroes of the sine function. The cosine and sine can be defined independently of geometry as a power series,^[11] or as the solution of a differential equation.

In a similar spirit, can be defined using properties of the complex exponential,, of a complex variable . Like the cosine, the complex exponential can be defined in one of several ways. The set of complex numbers at which is equal to one is then an (imaginary) arithmetic progression of the form:$$\backslash \; =\; \backslash$$and there is a unique positive real number with this property.^[12]

A variation on the same idea, making use of sophisticated mathematical concepts of topology and algebra, is the following theorem:^[13] there is a unique (up to automorphism) continuous isomorphism from the group R/Z of real numbers under addition modulo integers (the circle group), onto the multiplicative group of complex numbers of absolute value one. The number is then defined as half the magnitude of the derivative of this homomorphism.^[14]

Irrationality and normality

is an irrational number, meaning that it cannot be written as the ratio of two integers. Fractions such as and are commonly used to approximate, but no common fraction (ratio of whole numbers) can be its exact value. Because is irrational, it has an infinite number of digits in its decimal representation, and does not settle into an infinitely repeating pattern of digits. There are several proofs that is irrational; they generally require calculus and rely on the reductio ad absurdum technique. The degree to which 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 or but smaller than the measure of Liouville numbers.^[15]

The digits of 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 is normal has not been proven or disproven.

Since the advent of computers, a large number of digits of have been available on which to perform statistical analysis. Yasumasa Kanada has performed detailed statistical analyses on the decimal digits of, and found them consistent with normality; for example, the frequencies of the ten digits 0 to 9 were subjected to statistical significance tests, and no evidence of a pattern was found. Any random sequence of digits contains arbitrarily long subsequences that appear non-random, by the infinite monkey theorem. Thus, because the sequence of 's digits passes statistical tests for randomness, it contains some sequences of digits that may appear non-random, such as a sequence of six consecutive 9s that begins at the 762nd decimal place of the decimal representation of . This is also called the "Feynman point" in mathematical folklore, after Richard Feynman, although no connection to Feynman is known.

Transcendence

See also: Lindemann–Weierstrass theorem. In addition to being irrational, is also a transcendental number, which means that it is not the solution of any non-constant polynomial equation with rational coefficients, such as $\backslash frac-\backslash frac+x=0$.

The transcendence of has two important consequences: First, cannot be expressed using any finite combination of rational numbers and square roots or n-th roots (such as

\sqrt[ 3 ]{ 31 } or \sqrt{ 10 } ). 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 exactly 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 claim success—despite the fact that it is mathematically impossible.^{[16] [17]}

Continued fractions

As an irrational number, cannot be represented as a common fraction. But every number, including, can be represented by an infinite series of nested fractions, called a continued fraction:$$\backslash pi\; =\; 3+\backslash textstyle\; \backslash cfrac$$

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

The middle of these is due to the mid-17th century mathematician William Brouncker, see § Brouncker's formula.

Approximate value and digits

Some approximations of pi include:

• Integers: 3
• Fractions: Approximate fractions include (in order of increasing accuracy),,,,,, and . (List is selected terms from and .)
• Digits: The first 50 decimal digits are (see)

Digits in other number systems

• The first 48 binary (base 2) digits (called bits) are (see)
• The first 38 digits in ternary (base 3) are (see)
• The first 20 digits in hexadecimal (base 16) are (see)
• The first five sexagesimal (base 60) digits are 3;8,29,44,0,47^[20] (see)

Complex numbers and Euler's identity

Any complex number, say, can be expressed using a pair of real numbers. In the polar coordinate system, one number (radius or) is used to represent 's distance from the origin of the complex plane, and the other (angle or) the counter-clockwise rotation from the positive real line:$$z\; =\; r\backslash cdot(\backslash cos\backslash varphi\; +\; i\backslash sin\backslash varphi),$$where is the imaginary unit satisfying

i ^{2=-1} . The frequent appearance of in complex analysis can be related to the behaviour of the exponential function of a complex variable, described by Euler's formula:$$e^\; =\; \backslash cos\; \backslash varphi\; +\; i\backslash sin\; \backslash varphi,$$where the constant is the base of the natural logarithm. This formula establishes a correspondence between imaginary powers of and points on the unit circle centred at the origin of the complex plane. Setting \varphi = \pi in Euler's formula results in Euler's identity, celebrated in mathematics due to it containing five important mathematical constants:^[21] $$e^\; +\; 1\; =\; 0.$$

There are different complex numbers satisfying

z ^{n=1} , and these are called the "-th roots of unity" and are given by the formula:$$e^\; \backslash qquad\; (k\; =\; 0,\; 1,\; 2,\; \backslash dots,\; n\; -\; 1).$$

History

See also: Chronology of computation of π.

Antiquity

The best-known approximations to 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.

The earliest written approximations of are found in Babylon and Egypt, 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 as  = 3.125. 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 as $\backslash bigl(\backslash frac\backslash bigr)^2\backslash approx3.16$.^[18] Although some pyramidologists have theorized that the Great Pyramid of Giza was built with proportions related to, this theory is not widely accepted by scholars.^[22] In the Shulba Sutras of Indian mathematics, dating to an oral tradition from the first or second millennium BC, approximations are given which have been variously interpreted as approximately 3.08831, 3.08833, 3.004, 3, or 3.125.^[23]

Polygon approximation era

The first recorded algorithm for rigorously calculating the value of was a geometrical approach using polygons, devised around 250 BC by the Greek mathematician Archimedes, implementing the method of exhaustion. This polygonal algorithm dominated for over 1,000 years, and as a result is sometimes referred to as Archimedes's constant. Archimedes computed upper and lower bounds of 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 (that is,).^[24] Archimedes' upper bound of may have led to a widespread popular belief that is equal to . Around 150 AD, Greek-Roman scientist Ptolemy, in his Almagest, gave a value for of 3.1416, which he may have obtained from Archimedes or from Apollonius of Perga. Mathematicians using polygonal algorithms reached 39 digits of in 1630, a record only broken in 1699 when infinite series were used to reach 71 digits.^[25]

In ancient China, values for included 3.1547 (around 1 AD),

\sqrt{ 10 } (100 AD, approximately 3.1623), and (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 of 3.1416. Liu later invented a faster method of calculating 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 3 . 1415926 <\pi< 3 . 1415927 and suggested the approximations $\backslash pi\; \backslash approx\; \backslash frac\; =\; 3.14159292035...$ and $\backslash pi\; \backslash approx\; \backslash frac\; =\; 3.142857142857...$, which he termed the Milü (''close ratio") and Yuelü ("approximate ratio"), respectively, using Liu Hui's algorithm applied to a 12,288-sided polygon. With a correct value for its seven first decimal digits, this value remained the most accurate approximation of available for the next 800 years.

The Indian astronomer Aryabhata used a value of 3.1416 in his Āryabhaṭīya (499 AD). Fibonacci in computed 3.1418 using a polygonal method, independent of Archimedes. Italian author Dante apparently employed the value $3+\backslash frac\; \backslash approx\; 3.14142$.

The Persian astronomer Jamshīd al-Kāshī produced nine sexagesimal digits, roughly the equivalent of 16 decimal digits, in 1424, using a polygon with $3\backslash times\; 2^$ sides,^{[26] [27]} which stood as the world record for about 180 years. French mathematician François Viète in 1579 achieved nine digits with a polygon of $3\backslash times\; 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, 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.^[28] Christiaan Huygens was able to arrive at 10 decimal places in 1654 using a slightly different method equivalent to Richardson extrapolation.^{[29] [30]}

Infinite series

The calculation of 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 with much greater precision than Archimedes and others who used geometrical techniques. Although infinite series were exploited for most notably by European mathematicians such as James Gregory and Gottfried Wilhelm Leibniz, the approach also appeared in the Kerala school sometime in the 14th or 15th century. Around 1500 AD, a written description of an infinite series that could be used to compute was laid out in Sanskrit verse in Tantrasamgraha by Nilakantha Somayaji.^[31] The series are presented without proof, but proofs are presented in a later work, Yuktibhāṣā, from around 1530 AD. Several infinite series are described, including series for sine (which Nilakantha attributes to Madhava of Sangamagrama), cosine, and arctangent which are now sometimes referred to as Madhava series. The series for arctangent is sometimes called Gregory's series or the Gregory–Leibniz series. Madhava used infinite series to estimate to 11 digits around 1400.^[32]

In 1593, François Viète published what is now known as Viète's formula, an infinite product (rather than an infinite sum, which is more typically used in calculations):^[33] $$\backslash frac2\backslash pi\; =\; \backslash frac2\; \backslash cdot\; \backslash frac2\; \backslash cdot\; \backslash frac2\; \backslash cdots$$

In 1655, John Wallis published what is now known as Wallis product, also an infinite product:$$\backslash frac\; =\; \backslash Big(\backslash frac\; \backslash cdot\; \backslash frac\backslash Big)\; \backslash cdot\; \backslash Big(\backslash frac\; \backslash cdot\; \backslash frac\backslash Big)\; \backslash cdot\; \backslash Big(\backslash frac\; \backslash cdot\; \backslash frac\backslash Big)\; \backslash cdot\; \backslash Big(\backslash frac\; \backslash cdot\; \backslash frac\backslash Big)\; \backslash cdots$$

In the 1660s, the English scientist Isaac Newton and German mathematician Gottfried Wilhelm Leibniz discovered calculus, which led to the development of many infinite series for approximating . Newton himself used an arcsine series to compute a 15-digit approximation of in 1665 or 1666, writing, "I am ashamed to tell you to how many figures I carried these computations, having no other business at the time."^[34]

In 1671, James Gregory, and independently, Leibniz in 1673, discovered the Taylor series expansion for arctangent:^{[31] [35]} $$\backslash arctan\; z\; =\; z\; -\; \backslash frac\; +\backslash frac\; -\backslash frac\; +\backslash cdots$$

This series, sometimes called the Gregory–Leibniz series, equals $\backslash frac$ when evaluated with

z =1 . But for z =1 , it converges impractically slowly (that is, approaches the answer very gradually), taking about ten times as many terms to calculate each additional digit.^[36]

In 1699, English mathematician Abraham Sharp used the Gregory–Leibniz series for $z=\backslash frac$ to compute to 71 digits, breaking the previous record of 39 digits, which was set with a polygonal algorithm.

In 1706, John Machin used the Gregory–Leibniz series to produce an algorithm that converged much faster:^{[2] [37]} $$\backslash frac\; =\; 4\; \backslash arctan\; \backslash frac\; -\; \backslash arctan\; \backslash frac.$$

Machin reached 100 digits of 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 .^[38]

Isaac Newton accelerated the convergence of the Gregory–Leibniz series in 1684 (in an unpublished work; others independently discovered the result):^[39]

\arctan x = (x)/(1+ x ^{2}) + (23 (x ^{3})/(( 1+ x ^{2)} ^{2}))/(+) (2 ⋅ 4)/(3 ⋅ 5) (x ^{5})/(( 1+ x ^{2)} ^{3}) + …

Leonhard Euler popularized this series in his 1755 differential calculus textbook, and later used it with Machin-like formulae, including $\backslash tfrac\backslash pi4\; =\; 5\backslash arctan\backslash tfrac17\; +\; 2\backslash arctan\backslash tfrac,$ with which he computed 20 digits of in one hour.^[40]

Machin-like formulae remained the best-known method for calculating 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.

In 1844, a record was set by Zacharias Dase, who employed a Machin-like formula to calculate 200 decimals of in his head at the behest of German mathematician Carl Friedrich Gauss.

In 1853, British mathematician William Shanks calculated to 607 digits, but made a mistake in the 528th digit, rendering all subsequent digits incorrect. Though he calculated an additional 100 digits in 1873, bringing the total up to 707, his previous mistake rendered all the new digits incorrect as well.^[41]

Rate of convergence

Some infinite series for converge faster than others. Given the choice of two infinite series for, mathematicians will generally use the one that converges more rapidly because faster convergence reduces the amount of computation needed to calculate to any given accuracy.^[42] A simple infinite series for is the Gregory–Leibniz series:$$\backslash pi\; =\; \backslash frac\; -\; \backslash frac\; +\; \backslash frac\; -\; \backslash frac\; +\; \backslash frac\; -\; \backslash frac\; +\; \backslash frac\; -\; \backslash cdots$$

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

An infinite series for (published by Nilakantha in the 15th century) that converges more rapidly than the Gregory–Leibniz series is:^[44] $$\backslash pi\; =\; 3\; +\; \backslash frac\; -\; \backslash frac\; +\; \backslash frac\; -\; \backslash frac\; +\; \backslash cdots$$

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

Infinite series for	After 1st term	After 2nd term	After 3rd term	After 4th term	After 5th term	Converges to:
\pi = (4)/(1) - (4)/(3) + (4)/(5) - (4)/(7) + (4)/(9) - (4)/(11) + (4)/(13) + …	4.0000	2.6666 ...	3.4666 ...	2.8952 ...	3.3396 ...	= 3.1415 ...
\pi = {{ 3 }} + ({ 4)/() } - \frac + \frac - \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, whereas the sum of Nilakantha's series is within 0.002 of the correct value. Nilakantha's series converges faster and is more useful for computing digits of . 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

Not all mathematical advances relating to 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 and the prime numbers that later contributed to the development and study of the Riemann zeta function:

$$\backslash frac\; =\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash cdots$$

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

Adoption of the symbol

In the earliest usages, the Greek letter was used to denote the semiperimeter (semiperipheria in Latin) of a circle^[49] and was combined in ratios with (for diameter or semidiameter) or (for radius) to form circle constants.^{[50] [51] [52] [53]} (Before then, mathematicians sometimes used letters such as or instead.) The first recorded use is Oughtred's, to express the ratio of periphery and diameter in the 1647 and later editions of Latin: Clavis Mathematicae|italic=yes.^[54] Barrow likewise used to represent the constant,^[55] while Gregory instead used to represent .^[56]

The earliest known use of the Greek letter alone to represent the ratio of a circle's circumference to its diameter was by Welsh mathematician William Jones in his 1706 work Latin: Synopsis Palmariorum Matheseos|italic=unset; or, a New Introduction to the Mathematics.^[2] The Greek letter appears on p. 243 in the phrase "$\backslash tfrac12$ Periphery ", calculated for a circle with radius one. However, Jones writes that his equations for 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. Jones' notation was not immediately adopted by other mathematicians, with the fraction notation still being used as late as 1767.^[57]

Euler started using the single-letter form beginning with his 1727 Essay Explaining the Properties of Air, though he used, the ratio of periphery to radius, in this and some later writing.^{[58] [59]} Euler first used in his 1736 work Mechanica,^[60] and continued in his widely read 1748 work Latin: [[Introductio in analysin infinitorum]]|italic=yes (he wrote: "for the sake of brevity we will write this number as ; thus is equal to half the circumference of a circle of radius ").^[61] Because Euler corresponded heavily with other mathematicians in Europe, the use of the Greek letter spread rapidly, and the practice was universally adopted thereafter in the Western world, though the definition still varied between and as late as 1761.^[62]

Modern quest for more digits

Computer era and iterative algorithms

The development of computers in the mid-20th century again revolutionized the hunt for digits of . 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.^[63] The record, always relying on an arctan series, was broken repeatedly (3089 digits in 1955,^[64] 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 . First, the discovery of new iterative algorithms for computing, 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 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 physicist Eugene Salamin and 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, 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.^[65] Iterative methods were used by Japanese mathematician Yasumasa Kanada to set several records for computing between 1995 and 2002. This rapid convergence comes at a price: the iterative algorithms require significantly more memory than infinite series.^[66]

Motives for computing

For most numerical calculations involving, 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. Accounting for additional digits needed to compensate for computational round-off errors, Arndt concludes that a few hundred digits would suffice for any scientific application. Despite this, people have worked strenuously to compute to thousands and millions of digits. This effort may be partly ascribed to the human compulsion to break records, and such achievements with often make headlines around the world.^{[67] [68]} 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 .

Rapidly convergent series

Modern 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 Indian mathematician Srinivasa Ramanujan published dozens of innovative new formulae for, remarkable for their elegance, mathematical depth and rapid convergence. One of his formulae, based on modular equations, is$$\backslash frac\; =\; \backslash frac\; \backslash sum\_^\backslash infty\; \backslash frac.$$

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, setting a record of 17 million digits in 1985. Ramanujan's formulae anticipated the modern algorithms developed by the Borwein brothers (Jonathan and Peter) and the Chudnovsky brothers. The Chudnovsky formula developed in 1987 is$$\backslash frac\; =\; \backslash frac\; \backslash sum\_^\backslash infty\; \backslash frac.$$

It produces about 14 digits of per term and has been used for several record-setting calculations, including the first to surpass 1 billion (10⁹) digits in 1989 by the Chudnovsky brothers, 10 trillion (10¹³) digits in 2011 by Alexander Yee and Shigeru Kondo,^[69] and 100 trillion digits by Emma Haruka Iwao in 2022.^[70] For similar formulae, see also the Ramanujan–Sato series.

In 2006, mathematician Simon Plouffe used the PSLQ integer relation algorithm^[71] to generate several new formulae for, conforming to the following template:$$\backslash pi^k\; =\; \backslash sum\_^\backslash infty\; \backslash frac\; \backslash left(\backslash frac\; +\; \backslash frac\; +\; \backslash frac\backslash right),$$where is (Gelfond's constant), is an odd number, and are certain rational numbers that Plouffe computed.^[72]

Monte Carlo methods

Monte Carlo methods, which evaluate the results of multiple random trials, can be used to create approximations of . Buffon's needle is one such technique: If a needle of length is dropped times on a surface on which parallel lines are drawn units apart, and if of those times it comes to rest crossing a line ( > 0), then one may approximate based on the counts:^[73] $$\backslash pi\; \backslash approx\; \backslash frac.$$

Another Monte Carlo method for computing 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 .

Another way to calculate using probability is to start with a random walk, generated by a sequence of (fair) coin tosses: independent random variables such that with equal probabilities. The associated random walk is$$W\_n\; =\; \backslash sum\_^n\; X\_k$$so that, for each, is drawn from a shifted and scaled binomial distribution. As varies, defines a (discrete) stochastic process. Then can be calculated by^[74] $$\backslash pi\; =\; \backslash lim\_\; \backslash frac.$$

This Monte Carlo method is independent of any relation to circles, and is a consequence of the central limit theorem, discussed below.

These Monte Carlo methods for approximating are very slow compared to other methods, and do not provide any information on the exact number of digits that are obtained. Thus they are never used to approximate when speed or accuracy is desired.

Spigot algorithms

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

Mathematicians Stan Wagon and Stanley Rabinowitz produced a simple spigot algorithm in 1995.^[76] 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:^[77] $$\backslash pi\; =\; \backslash sum\_^\backslash infty\; \backslash frac\; \backslash left(\backslash frac\; -\; \backslash frac\; -\; \backslash frac\; -\; \backslash frac\backslash right).$$

This formula, unlike others before it, can produce any individual hexadecimal digit of 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. An important application of digit extraction algorithms is to validate new claims of record 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 randomly selected 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, which turned out to be 0.^[78] 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 at the two-quadrillionth (2×10¹⁵th) bit, which also happens to be zero.^[79]

In 2022, Plouffe found a base-10 algorithm for calculating digits of .^[80]

Role and characterizations in mathematics

Because 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. Other branches of science, such as statistics, physics, Fourier analysis, and number theory, also include in some of their important formulae.

Geometry and trigonometry

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 .

• The circumference of a circle with radius is .
• The area of a circle with radius is .
• The area of an ellipse with semi-major axis and semi-minor axis is .
• The volume of a sphere with radius is .
• The surface area of a sphere with radius is .

Some of the formulae above are special cases of the volume of the n-dimensional ball and the surface area of its boundary, the (n−1)-dimensional sphere, given below.

Apart from circles, there are other curves of constant width. By Barbier's theorem, every curve of constant width has perimeter times its width. The Reuleaux triangle (formed by the intersection of three circles with the sides of an equilateral triangle as their radii) has the smallest possible area for its width and the circle the largest. There also exist non-circular smooth and even algebraic curves of constant width.^[81]

Definite integrals that describe circumference, area, or volume of shapes generated by circles typically have values that involve . For example, an integral that specifies half the area of a circle of radius one is given by:^[82] $$\backslash int\_^1\; \backslash sqrt\backslash ,dx\; =\; \backslash frac.$$

In that integral, the function

\sqrt{ 1- x ^{2}} represents the height over the x -axis of a semicircle (the square root is a consequence of the Pythagorean theorem), and the integral computes the area below the semicircle.

Units of angle

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

Common trigonometric functions have periods that are multiples of ; for example, sine and cosine have period 2, so for any angle and any integer,$$\backslash sin\backslash theta\; =\; \backslash sin\backslash left(\backslash theta\; +\; 2\backslash pi\; k\; \backslash right)\; \backslash text\; \backslash cos\backslash theta\; =\; \backslash cos\backslash left(\backslash theta\; +\; 2\backslash pi\; k\; \backslash right).$$

Eigenvalues

Many of the appearances of in the formulae of mathematics and the sciences have to do with its close relationship with geometry. However, also appears in many natural situations having apparently nothing to do with geometry.

f''(x) + λ f(x) = 0 , or f''(t) = -λ f(x) . Thus is an eigenvalue of the second derivative operator f \mapsto f'' , and is constrained by Sturm–Liouville theory to take on only certain specific values. It must be positive, since the operator is negative definite, so it is convenient to write, where is called the wavenumber. Then satisfies the boundary conditions and the differential equation with .^[83]

The value is, in fact, the least such value of the wavenumber, and is associated with the fundamental mode of vibration of the string. One way to show this is by estimating the energy, which satisfies Wirtinger's inequality: for a function

f : [ 0 , 1 ] \to \Complex with and, both square integrable, we have:$$\backslash pi^2\backslash int\_0^1|f(x)|^2\backslash ,dx\backslash le\; \backslash int\_0^1|f\text{'}(x)|^2\backslash ,dx,$$with equality precisely when is a multiple of . Here appears as an optimal constant in Wirtinger's inequality, and it follows that it is the smallest wavenumber, using the variational characterization of the eigenvalue. As a consequence, is the smallest singular value of the derivative operator on the space of functions on vanishing at both endpoints (the Sobolev space H ^{1} _{0 [ 0 , 1 ]} ).

Inequalities

The number serves appears in similar eigenvalue problems in higher-dimensional analysis. As mentioned above, it can be characterized via its role as the best constant in the isoperimetric inequality: the area enclosed by a plane Jordan curve of perimeter satisfies the inequality$$4\backslash pi\; A\backslash le\; P^2,$$and equality is clearly achieved for the circle, since in that case and .^[84]

Ultimately, as a consequence of the isoperimetric inequality, appears in the optimal constant for the critical Sobolev inequality in n dimensions, which thus characterizes the role of in many physical phenomena as well, for example those of classical potential theory.^{[85] [86] [87]} In two dimensions, the critical Sobolev inequality is$$2\backslash pi\backslash |f\backslash |\_2\; \backslash le\; \backslash |\backslash nabla\; f\backslash |\_1$$for f a smooth function with compact support in,

\nabla f is the gradient of f, and \|f\| _{2} and \|\nabla f\| _{1} refer respectively to the and -norm. The Sobolev inequality is equivalent to the isoperimetric inequality (in any dimension), with the same best constants.

Wirtinger's inequality also generalizes to higher-dimensional Poincaré inequalities that provide best constants for the Dirichlet energy of an n-dimensional membrane. Specifically, is the greatest constant such that$$\backslash pi\; \backslash le\; \backslash frac$$for all convex subsets of of diameter 1, and square-integrable functions u on of mean zero.^[88] Just as Wirtinger's inequality is the variational form of the Dirichlet eigenvalue problem in one dimension, the Poincaré inequality is the variational form of the Neumann eigenvalue problem, in any dimension.

Fourier transform and Heisenberg uncertainty principle

The constant also appears as a critical spectral parameter in the Fourier transform. This is the integral transform, that takes a complex-valued integrable function on the real line to the function defined as:$$\backslash hat(\backslash xi)\; =\; \backslash int\_^\backslash infty\; f(x)\; e^\backslash ,dx.$$

Although there are several different conventions for the Fourier transform and its inverse, any such convention must involve somewhere. The above is the most canonical definition, however, giving the unique unitary operator on that is also an algebra homomorphism of to .^[89]

The Heisenberg uncertainty principle also contains the number . The uncertainty principle gives a sharp lower bound on the extent to which it is possible to localize a function both in space and in frequency: with our conventions for the Fourier transform,$$\backslash left(\backslash int\_^\backslash infty\; x^2|f(x)|^2\backslash ,dx\backslash right)\backslash left(\backslash int\_^\backslash infty\; \backslash xi^2|\backslash hat(\backslash xi)|^2\backslash ,d\backslash xi\backslash right)\; \backslash ge\backslash left(\backslash frac\backslash int\_^\backslash infty\; |f(x)|^2\backslash ,dx\backslash right)^2.$$

The physical consequence, about the uncertainty in simultaneous position and momentum observations of a quantum mechanical system, is discussed below. The appearance of in the formulae of Fourier analysis is ultimately a consequence of the Stone–von Neumann theorem, asserting the uniqueness of the Schrödinger representation of the Heisenberg group.^[90]

Gaussian integrals

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.^[91] The Gaussian function, which is the probability density function of the normal distribution with mean and standard deviation, naturally contains :$$f(x)\; =\; \backslash ,e^.$$

The factor of

\tfrac{ 1 }{\sqrt{ 2 \pi}} makes the area under the graph of equal to one, as is required for a probability distribution. This follows from a change of variables in the Gaussian integral:$$\backslash int\_^\backslash infty\; e^\; \backslash ,\; du=\backslash sqrt$$which says that the area under the basic bell curve in the figure is equal to the square root of .

The central limit theorem explains the central role of normal distributions, and thus of, in probability and statistics. This theorem is ultimately connected with the spectral characterization of as the eigenvalue associated with the Heisenberg uncertainty principle, and the fact that equality holds in the uncertainty principle only for the Gaussian function. Equivalently, is the unique constant making the Gaussian normal distribution equal to its own Fourier transform.^[92] Indeed, according to, the "whole business" of establishing the fundamental theorems of Fourier analysis reduces to the Gaussian integral.^[90]

Topology

The constant appears in the Gauss–Bonnet formula which relates the differential geometry of surfaces to their topology. Specifically, if a compact surface has Gauss curvature K, then$$\backslash int\_\backslash Sigma\; K\backslash ,dA\; =\; 2\backslash pi\; \backslash chi(\backslash Sigma)$$where is the Euler characteristic, which is an integer.^[93] An example is the surface area of a sphere S of curvature 1 (so that its radius of curvature, which coincides with its radius, is also 1.) The Euler characteristic of a sphere can be computed from its homology groups and is found to be equal to two. Thus we have$$A(S)\; =\; \backslash int\_S\; 1\backslash ,dA\; =\; 2\backslash pi\backslash cdot\; 2\; =\; 4\backslash pi$$reproducing the formula for the surface area of a sphere of radius 1.

The constant appears in many other integral formulae in topology, in particular, those involving characteristic classes via the Chern–Weil homomorphism.^[94]

Cauchy's integral formula

One of the key tools in complex analysis is contour integration of a function over a positively oriented (rectifiable) Jordan curve . A form of Cauchy's integral formula states that if a point is interior to, then^[95] $$\backslash oint\_\backslash gamma\; \backslash frac\; =\; 2\backslash pi\; i.$$

Although the curve is not a circle, and hence does not have any obvious connection to the constant, a standard proof of this result uses Morera's theorem, which implies that the integral is invariant under homotopy of the curve, so that it can be deformed to a circle and then integrated explicitly in polar coordinates. More generally, it is true that if a rectifiable closed curve does not contain, then the above integral is times the winding number of the curve.

The general form of Cauchy's integral formula establishes the relationship between the values of a complex analytic function on the Jordan curve and the value of at any interior point of :^[96] $$\backslash oint\_\backslash gamma\; \backslash ,dz\; =\; 2\backslash pi\; i\; f\; (z\_)$$provided is analytic in the region enclosed by and extends continuously to . Cauchy's integral formula is a special case of the residue theorem, that if is a meromorphic function the region enclosed by and is continuous in a neighbourhood of, then$$\backslash oint\_\backslash gamma\; g(z)\backslash ,\; dz\; =2\backslash pi\; i\; \backslash sum\; \backslash operatorname(g,\; a\_k)$$where the sum is of the residues at the poles of .

Vector calculus and physics

The constant is ubiquitous in vector calculus and potential theory, for example in Coulomb's law,^[97] Gauss's law, Maxwell's equations, and even the Einstein field equations.^{[98] [99]} Perhaps the simplest example of this is the two-dimensional Newtonian potential, representing the potential of a point source at the origin, whose associated field has unit outward flux through any smooth and oriented closed surface enclosing the source:$$\backslash Phi(\backslash mathbf\; x)\; =\; \backslash frac\backslash log|\backslash mathbf\; x|.$$The factor of

1 / 2 \pi is necessary to ensure that \Phi is the fundamental solution of the Poisson equation in R ^{2} :$$\backslash Delta\backslash Phi\; =\; \backslash delta$$where \delta is the Dirac delta function.

In higher dimensions, factors of are present because of a normalization by the n-dimensional volume of the unit n sphere. For example, in three dimensions, the Newtonian potential is:$$\backslash Phi(\backslash mathbf\; x)\; =\; -\backslash frac,$$which has the 2-dimensional volume (i.e., the area) of the unit 2-sphere in the denominator.

The gamma function and Stirling's approximation

The factorial function

n! is the product of all of the positive integers through . The gamma function extends the concept of factorial (normally defined only for non-negative integers) to all complex numbers, except the negative real integers, with the identity \Gamma(n) = (n -1 )! . When the gamma function is evaluated at half-integers, the result contains . For example, \Gamma( 1 / 2 ) = \sqrt{\pi} and $\backslash Gamma(5/2)\; =\; \backslash frac$.

The gamma function is defined by its Weierstrass product development:^[100] $$\backslash Gamma(z)\; =\; \backslash frac\backslash prod\_^\backslash infty\; \backslash frac$$where is the Euler–Mascheroni constant. Evaluated at and squared, the equation reduces to the Wallis product formula. The gamma function is also connected to the Riemann zeta function and identities for the functional determinant, in which the constant plays an important role.

The gamma function is used to calculate the volume of the n-dimensional ball of radius r in Euclidean n-dimensional space, and the surface area of its boundary, the (n−1)-dimensional sphere:^[101] $$V\_n(r)\; =\; \backslash fracr^n,$$$$S\_(r)\; =\; \backslash fracr^.$$

Further, it follows from the functional equation that$$2\backslash pi\; r\; =\; \backslash frac.$$

The gamma function can be used to create a simple approximation to the factorial function for large : $n!\; \backslash sim\; \backslash sqrt\; \backslash left(\backslash frac\backslash right)^n$ which is known as Stirling's approximation. Equivalently,$$\backslash pi\; =\; \backslash lim\_\; \backslash frac.$$

As a geometrical application of Stirling's approximation, let denote the standard simplex in n-dimensional Euclidean space, and denote the simplex having all of its sides scaled up by a factor of . Then$$\backslash operatorname((n+1)\backslash Delta\_n)\; =\; \backslash frac\; \backslash sim\; \backslash frac.$$

Ehrhart's volume conjecture is that this is the (optimal) upper bound on the volume of a convex body containing only one lattice point.^[102]

Number theory and Riemann zeta function

The Riemann zeta function is used in many areas of mathematics. When evaluated at it can be written as$$\backslash zeta(2)\; =\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash 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 . 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 .^[103] This probability is based on the observation that the probability that any number is divisible by a prime is (for example, every 7th integer is divisible by 7.) Hence the probability that two numbers are both divisible by this prime is, and the probability that at least one of them is not is . 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:^[104]

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

The solution to the Basel problem implies that the geometrically derived quantity is connected in a deep way to the distribution of prime numbers. This is a special case of Weil's conjecture on Tamagawa numbers, which asserts the equality of similar such infinite products of arithmetic quantities, localized at each prime p, and a geometrical quantity: the reciprocal of the volume of a certain locally symmetric space. In the case of the Basel problem, it is the hyperbolic 3-manifold .^[105]

The zeta function also satisfies Riemann's functional equation, which involves as well as the gamma function:$$\backslash zeta(s)\; =\; 2^s\backslash pi^\backslash \; \backslash sin\backslash left(\backslash frac\backslash right)\backslash \; \backslash Gamma(1-s)\backslash \; \backslash zeta(1-s).$$

Furthermore, the derivative of the zeta function satisfies$$\backslash exp(-\backslash zeta\text{'}(0))\; =\; \backslash sqrt.$$

A consequence is that can be obtained from the functional determinant of the harmonic oscillator. This functional determinant can be computed via a product expansion, and is equivalent to the Wallis product formula.^[106] The calculation can be recast in quantum mechanics, specifically the variational approach to the spectrum of the hydrogen atom.^[107]

Fourier series

The constant also appears naturally in Fourier series of periodic functions. Periodic functions are functions on the group of fractional parts of real numbers. The Fourier decomposition shows that a complex-valued function on can be written as an infinite linear superposition of unitary characters of . That is, continuous group homomorphisms from to the circle group of unit modulus complex numbers. It is a theorem that every character of is one of the complex exponentials

e _{n(x)=} e ^{2\pi} .

There is a unique character on, up to complex conjugation, that is a group isomorphism. Using the Haar measure on the circle group, the constant is half the magnitude of the Radon–Nikodym derivative of this character. The other characters have derivatives whose magnitudes are positive integral multiples of 2. As a result, the constant is the unique number such that the group T, equipped with its Haar measure, is Pontrjagin dual to the lattice of integral multiples of 2. This is a version of the one-dimensional Poisson summation formula.

Modular forms and theta functions

The constant is connected in a deep way with the theory of modular forms and theta functions. For example, the Chudnovsky algorithm involves in an essential way the j-invariant of an elliptic curve.

SL _{2(Z)} (or its various subgroups), a lattice in the group SL _{2(R)} . An example is the Jacobi theta function$$\backslash theta(z,\backslash tau)\; =\; \backslash sum\_^\backslash infty\; e^$$which is a kind of modular form called a Jacobi form.^[108] This is sometimes written in terms of the nome q = e ^{\pi} .

The constant is the unique constant making the Jacobi theta function an automorphic form, which means that it transforms in a specific way. Certain identities hold for all automorphic forms. An example is$$\backslash theta(z+\backslash tau,\backslash tau)\; =\; e^\backslash theta(z,\backslash tau),$$which implies that transforms as a representation under the discrete Heisenberg group. General modular forms and other theta functions also involve, once again because of the Stone–von Neumann theorem.

Cauchy distribution and potential theory

The Cauchy distribution$$g(x)=\backslash frac\backslash cdot\backslash frac$$is a probability density function. The total probability is equal to one, owing to the integral:$$\backslash int\_^\; \backslash frac\; \backslash ,\; dx\; =\; \backslash pi.$$

The Shannon entropy of the Cauchy distribution is equal to, which also involves .

The Cauchy distribution plays an important role in potential theory because it is the simplest Furstenberg measure, the classical Poisson kernel associated with a Brownian motion in a half-plane.^[109] Conjugate harmonic functions and so also the Hilbert transform are associated with the asymptotics of the Poisson kernel. The Hilbert transform H is the integral transform given by the Cauchy principal value of the singular integral$$Hf(t)\; =\; \backslash frac\backslash int\_^\backslash infty\; \backslash frac.$$

The constant is the unique (positive) normalizing factor such that H defines a linear complex structure on the Hilbert space of square-integrable real-valued functions on the real line.^[110] The Hilbert transform, like the Fourier transform, can be characterized purely in terms of its transformation properties on the Hilbert space : up to a normalization factor, it is the unique bounded linear operator that commutes with positive dilations and anti-commutes with all reflections of the real line.^[111] The constant is the unique normalizing factor that makes this transformation unitary.

In the Mandelbrot set

An occurrence of in the fractal called the Mandelbrot set was discovered by David Boll in 1991.^[112] He examined the behaviour of the Mandelbrot set near the "neck" at . When the number of iterations until divergence for the point is multiplied by, the result approaches as approaches zero. The point 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 .^[113]

Projective geometry

Let be the set of all twice differentiable real functions

f: R\to R that satisfy the ordinary differential equation f''(x) + f(x) =0 . Then is a two-dimensional real vector space, with two parameters corresponding to a pair of initial conditions for the differential equation. For any t\in R , let e _{t:V\toR} be the evaluation functional, which associates to each f\in V the value e _{t(f)=f(t)} of the function at the real point . Then, for each t, the kernel of e _{t} is a one-dimensional linear subspace of . Hence t\mapsto\ker e _{t} defines a function from R\to P(V) from the real line to the real projective line. This function is periodic, and the quantity can be characterized as the period of this map.^[114] This is notable in that the constant, rather than 2, appears naturally in this context.

Outside mathematics

Describing physical phenomena

Although not a physical constant, appears routinely in equations describing fundamental principles of the universe, often because of 's relationship to the circle and to spherical coordinate systems. A simple formula from the field of classical mechanics gives the approximate period of a simple pendulum of length, swinging with a small amplitude (is the earth's gravitational acceleration):^[115] $$T\; \backslash approx\; 2\backslash pi\; \backslash sqrt\backslash frac.$$

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 (Δ) and momentum (Δ) cannot both be arbitrarily small at the same time (where is the Planck constant):^[116] $$\backslash Delta\; x\backslash ,\; \backslash Delta\; p\; \backslash ge\; \backslash frac.$$

The fact that 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 is^[117] $$\backslash frac\; =\; 2\backslash fracm\_\backslash text\backslash alpha^,$$where is the mass of the electron.

is present in some structural engineering formulae, such as the buckling formula derived by Euler, which gives the maximum axial load that a long, slender column of length, modulus of elasticity, and area moment of inertia can carry without buckling:^[118] $$F\; =\backslash frac.$$

The field of fluid dynamics contains in Stokes' law, which approximates the frictional force exerted on small, spherical objects of radius, moving with velocity in a fluid with dynamic viscosity :^[119] $$F\; =6\backslash pi\backslash eta\; Rv.$$

In electromagnetics, the vacuum permeability constant μ₀ appears in Maxwell's equations, which describe the properties of electric and magnetic fields and electromagnetic radiation. Before 20 May 2019, it was defined as exactly$$\backslash mu\_0\; =\; 4\; \backslash pi\; \backslash times\; 10^\backslash text\; \backslash approx\; 1.2566370614\; \backslash ldots\; \backslash times\; 10\; ^\; \backslash text^2.$$

Memorizing digits

See main article: Piphilology. Piphilology is the practice of memorizing large numbers of digits of, and world-records are kept by the Guinness World Records. The record for memorizing digits of, 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.^[120] 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.^[121]

One common technique is to memorize a story or poem in which the word lengths represent the digits of : 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. Such memorization aids are called mnemonics. An early example of a mnemonic for pi, 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.^[122] Poems for memorizing have been composed in several languages in addition to English. Record-setting memorizers typically do not rely on poems, but instead use methods such as remembering number patterns and the method of loci.^[123]

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

In popular culture

Perhaps because of the simplicity of its definition and its ubiquitous presence in formulae, has been represented in popular culture more than other mathematical constructs.^[126]

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 . The digits are large wooden characters attached to the dome-like ceiling. The digits were based on an 1873 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 1985 novel Contact it is suggested that the creator of the universe buried a message deep within the digits of . This part of the story was omitted from the film adaptation of the novel.^[127] The digits of have also been incorporated into the lyrics of the song "Pi" from the 2005 album Aerial by Kate Bush.^[128] In the 1967 Star Trek episode "Wolf in the Fold", an out-of-control computer is contained by being instructed to "Compute to the last digit the value of ".^[24]

In the United States, Pi Day falls on 14 March (written 3/14 in the US style), and is popular among students.^[24] and its digital representation are often used by self-described "math geeks" for inside jokes among mathematically and technologically minded groups. A college cheer variously attributed to the Massachusetts Institute of Technology or the Rensselaer Polytechnic Institute includes "3.14159".^{[129] [130]} Pi Day in 2015 was particularly significant because the date and time 3/14/15 9:26:53 reflected many more digits of pi.^{[131] [132]} In parts of the world where dates are commonly noted in day/month/year format, 22 July represents "Pi Approximation Day", as 22/7 = 3.142857.^[133]

Some have proposed replacing by,^[134] arguing that, as the number of radians in one turn or the ratio of a circle's circumference to its radius, is more natural than and simplifies many formulae.^{[135] [136]} This use of has not made its way into mainstream mathematics,^[137] but since 2010 this has led to people celebrating Two Pi Day or Tau Day on June 28.^[138]

In 1897, an amateur 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, including 3.2. The bill is notorious as an attempt to establish a value of mathematical constant by legislative fiat. The bill was passed by the Indiana House of Representatives, but rejected by the Senate, and thus it did not become a law.^[139]

In computer culture

In contemporary internet culture, individuals and organizations frequently pay homage to the number . For instance, the computer scientist Donald Knuth let the version numbers of his program TeX approach . The versions are 3, 3.1, 3.14, and so forth.^[140] has been added to several programming languages as a predefined constant.^{[141] [142]}

See also

• Approximations of
• Chronology of computation of
• List of mathematical constants

References

General and cited sources

• Book: Abramson, Jay. Precalculus. OpenStax. 2014.
• Book: Andrews . George E. . Askey . Richard . Roy . Ranjan . Special Functions . 1999 . University Press . Cambridge . 978-0-521-78988-2.
• Book: Arndt . Jörg . Haenel . Christoph . Pi Unleashed . Springer-Verlag . 2006 . 978-3-540-66572-4 . 5 June 2013. English translation by Catriona and David Lischka.
• Book: Berggren . Lennart . Borwein . Jonathan. Jonathan Borwein . Borwein . Peter. Peter Borwein . Pi: a Source Book . Springer-Verlag . 1997 . 978-0-387-20571-7 .
• Book: Boyer . Carl B. . Merzbach . Uta C.. Uta Merzbach . 1991 . A History of Mathematics . registration . 2 . Wiley . 978-0-471-54397-8 .
• Book: Bronshteĭn . Ilia . Semendiaev . K.A. . A Guide Book to Mathematics . . 1971 . 978-3-87144-095-3 . A Guide Book to Mathematics.
• Book: H. . Dym . H. P. . McKean . Fourier series and integrals . Academic Press . 1972 .
  • Book: Posamentier . Alfred S. . Lehmann . Ingmar .

    A Biography of the World's Most Mysterious Number

    . registration . Prometheus Books . 2004 . 978-1-59102-200-8 .
• Book: Remmert, Reinhold . Heinz-Dieter Ebbinghaus . Hans Hermes . Friedrich Hirzebruch . Max Koecher . Klaus Mainzer . Jürgen Neukirch . Alexander Prestel . Reinhold Remmert . Numbers. https://books.google.com/books?id=Z53SBwAAQBAJ&pg=PA123 . Ch. 5 What is π? . 2012 . Springer . 978-1-4612-1005-4.

Further reading

• Book: Blatner, David . The Joy of . Walker & Company . 1999 . 978-0-8027-7562-7 .
• Book: Delahaye, Jean-Paul . Jean-Paul Delahaye . Le fascinant nombre . Paris . Bibliothèque Pour la Science . 1997 . 2-902918-25-9.

External links

• • Demonstration by Lambert (1761) of irrationality of, online and analysed BibNum (PDF).
• Search Engine 2 billion searchable digits of, and
• approximation von π by lattice points and approximation of π with rectangles and trapezoids (interactive illustrations)

Notes and References

1. R. C. . Gupta . On the remainder term in the Madhava–Leibniz's series . Ganita Bharati . 14 . 1–4 . 1992 . 68–71.
2. Book: Jones, William . William Jones (mathematician) . 1706 . Synopsis Palmariorum Matheseos . London . J. Wale . 243, 263 . 263 . There are various other ways of finding the Lengths, or Areas of particular Curve Lines or Planes, which may very much facilitate the Practice; as for instance, in the Circle, the Diameter is to Circumference as 1 to \overline{\tfrac{ 16 } 5 - \tfrac 4 { 239 }} - \tfrac 13 \overline{\tfrac{ 16 }{ 5 ^{3}} - \tfrac 4 { 239 ^{3}} +} \tfrac 15 \overline{\tfrac{ 16 }{ 5 ^{5}} - \tfrac 4 { 239 ^{5}} -,} \&c. = . This Series (among others for the same purpose, and drawn from the same Principle) I receiv'd from the Excellent Analyst, and my much Esteem'd Friend Mr. John Machin; and by means thereof, Van Ceulens Number, or that in Art. 64.38. may be Examin'd with all desireable Ease and Dispatch..

   Reprinted in Book: Smith, David Eugene . 1929 . A Source Book in Mathematics . McGraw–Hill . William Jones: The First Use of for the Circle Ratio . https://archive.org/details/sourcebookinmath1929smit/page/346/ . 346–347 .

3. Web site: π^e trillion digits of π . https://web.archive.org/web/20161206063441/http://www.pi2e.ch/ . pi2e.ch . 6 December 2016 . live.
4. Web site: Haruka Iwao . Emma . Emma Haruka Iwao . Pi in the sky: Calculating a record-breaking 31.4 trillion digits of Archimedes' constant on Google Cloud . . 14 March 2019 . 12 April 2019 . https://web.archive.org/web/20191019023120/https://cloud.google.com/blog/products/compute/calculating-31-4-trillion-digits-of-archimedes-constant-on-google-cloud . 19 October 2019 . live.
5. Bailey . David H. . Plouffe . Simon M. . Borwein . Peter B. . Borwein . Jonathan M. . The quest for PI . . 19 . 1 . 1997 . 50–56 . 0343-6993 . 10.1007/BF03024340 . 10.1.1.138.7085. 14318695 .
6. Web site: pi . Dictionary.reference.com . 2 March 1993 . 18 June 2012. live . https://web.archive.org/web/20140728121603/http://dictionary.reference.com/browse/pi?s=t . 28 July 2014.
7. Book: Apostol, Tom . Tom M. Apostol . Calculus. 1 . Wiley . 2nd . 1967. 102. From a logical point of view, this is unsatisfactory at the present stage because we have not yet discussed the concept of arc length.
8. Book: Baltzer, Richard . Die Elemente der Mathematik . de . The Elements of Mathematics . 1870 . 195 . Hirzel . live . https://web.archive.org/web/20160914204826/https://archive.org/details/dieelementederm02baltgoog . 14 September 2016.
9. Book: Landau, Edmund . Edmund Landau . Einführung in die Differentialrechnung und Integralrechnung . de . Noordoff . 1934 . 193.
10. Book: Rudin, Walter . Principles of Mathematical Analysis . registration . McGraw-Hill . 1976 . 978-0-07-054235-8. 183.
11. Book: Rudin, Walter . Real and complex analysis . McGraw-Hill . 1986. 2.
12. Book: Ahlfors, Lars . Lars Ahlfors . Complex analysis . McGraw-Hill . 1966 . 46.
13. Book: Bourbaki, Nicolas . Nicolas Bourbaki . Topologie generale . Springer . 1981. §VIII.2.
14. Book: Bourbaki, Nicolas . Nicolas Bourbaki . Fonctions d'une variable réelle . fr . Springer . 1979. §II.3.
15. Salikhov . V. . 2008 . On the Irrationality Measure of pi . Russian Mathematical Surveys . 53 . 3 . 570–572 . 10.1070/RM2008v063n03ABEH004543 . 2008RuMaS..63..570S. 250798202 . 0036-0279 .
16. Book: Beckmann, Peter . History of Pi . St. Martin's Press . 1989 . 1974 . 978-0-88029-418-8 . 37.
17. Book: Schlager . Neil . Lauer . Josh . Science and Its Times: Understanding the Social Significance of Scientific Discovery . Gale Group . 2001 . 978-0-7876-3933-4. registration . 19 December 2019. https://web.archive.org/web/20191213112426/https://archive.org/details/scienceitstimesu0000unse. 13 December 2019. live., p. 185.
18. Mollin. R. A.. 3. Nieuw Archief voor Wiskunde. 1743850. 383–405. Continued fraction gems. 17. 1999.
19. An Elegant Continued Fraction for . L.J.. Lange. The American Mathematical Monthly. 106. 5. May 1999 . 456–458. 2589152. 10.2307/2589152.
20. Abu-r-Raihan al-Biruni, 973–1048 . Kennedy . E.S. . Journal for the History of Astronomy . 9 . 65 . 1978JHA.....9...65K . 10.1177/002182867800900106 . 1978. 126383231 . Ptolemy used a three-sexagesimal-digit approximation, and Jamshīd al-Kāshī expanded this to nine digits; see Book: Aaboe, Asger . Asger Aaboe . 1964 . Episodes from the Early History of Mathematics . New Mathematical Library . 13 . Random House . New York . 125 . live . https://web.archive.org/web/20161129205051/https://books.google.com/books?id=5wGzF0wPFYgC&pg=PA125 . 29 November 2016 . dmy-all . 978-0-88385-613-0.
21. Book: Maor, Eli. E: The Story of a Number. Princeton University Press. 2009. 160. 978-0-691-14134-3.
22. Book: Herz-Fischler, Roger . 67–77, 165–166 . The Shape of the Great Pyramid . Wilfrid Laurier University Press . 2000 . 978-0-88920-324-2 . 5 June 2013 . live . https://web.archive.org/web/20161129205154/https://books.google.com/books?id=066T3YLuhA0C&pg=67 . 29 November 2016.
23. Book: Plofker, Kim. 27. Mathematics in India. Mathematics in India (book). 2009. Princeton University Press. 978-0691120676.
24. Book: Borwein, Jonathan M.. Jonathan Borwein. Sidoli. Nathan. Van Brummelen. Glen. The life of : from Archimedes to ENIAC and beyond. 10.1007/978-3-642-36736-6_24. Heidelberg. 3203895. 531–561. Springer. From Alexandria, through Baghdad: Surveys and studies in the ancient Greek and medieval Islamic mathematical sciences in honor of J. L. Berggren. 2014. 978-3-642-36735-9 .
25. . Grienberger achieved 39 digits in 1630; Sharp 71 digits in 1699.
26. Mohammad K. . Azarian . al-Risāla al-muhītīyya: A Summary . Missouri Journal of Mathematical Sciences . 22 . 2 . 2010 . 64–85 . 10.35834/mjms/1312233136. free.
27. Web site: O'Connor . John J. . Robertson . Edmund F. . 1999 . Ghiyath al-Din Jamshid Mas'ud al-Kashi . . 11 August 2012 . live . https://web.archive.org/web/20110412192025/http://www-history.mcs.st-and.ac.uk/history/Biographies/Al-Kashi.html . 12 April 2011.
28. Book: Grienbergerus, Christophorus . Christoph Grienberger . la . 1630 . Elementa Trigonometrica . https://web.archive.org/web/20140201234124/http://librarsi.comune.palermo.it/gesuiti2/06.04.01.pdf . 1 February 2014. His evaluation was 3.14159 26535 89793 23846 26433 83279 50288 4196 < < 3.14159 26535 89793 23846 26433 83279 50288 4199.
29. Book: Brezinski, C.. Some pioneers of extrapolation methods. 2009. The Birth of Numerical Analysis. 1–22. World Scientific. 10.1142/9789812836267_0001. 978-981-283-625-0. Adhemar. Bultheel. Adhemar Bultheel. Ronald. Cools.
30. Yoder. Joella G.. 1996. Following in the footsteps of geometry: The mathematical world of Christiaan Huygens. De Zeventiende Eeuw. 12. 83–93. Digital Library for Dutch Literature.
31. Roy . Ranjan . 1990 . The Discovery of the Series Formula for by Leibniz, Gregory and Nilakantha . Mathematics Magazine . 63 . 5 . 291–306 . 10.1080/0025570X.1990.11977541 . 21 February 2023 . 14 March 2023 . https://web.archive.org/web/20230314224252/https://www.maa.org/sites/default/files/images/upload_library/22/Allendoerfer/1991/0025570x.di021167.02p0073q.pdf . dead .
32. Book: Joseph, George Gheverghese . The Crest of the Peacock: Non-European Roots of Mathematics . Princeton University Press . 1991 . 978-0-691-13526-7 . 264.
33. Book: Vieta, Franciscus. Variorum de rebus mathematicis responsorum. VIII. 1593.
34. . Newton quoted by Arndt.
35. Horvath . Miklos . On the Leibnizian quadrature of the circle. . Annales Universitatis Scientiarum Budapestiensis (Sectio Computatorica) . 4 . 1983 . 75–83 .
36. Cooker . M.J. . 2011 . Fast formulas for slowly convergent alternating series . Mathematical Gazette . 95 . 533 . 218–226 . 10.1017/S0025557200002928 . 123392772 . 23 February 2023 . 4 May 2019 . https://web.archive.org/web/20190504091131/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/F7C083868DEB95FE049CD44163367592/S0025557200002928a.pdf/div-class-title-fast-formulas-for-slowly-convergent-alternating-series-div.pdf . bot: unknown .
37. Tweddle . Ian . 1991 . John Machin and Robert Simson on Inverse-tangent Series for . Archive for History of Exact Sciences . 42 . 1 . 1–14 . 10.1007/BF00384331 . 41133896 . 121087222 .
38. Lehmer . D. H. . D. H. Lehmer . 1938 . On Arccotangent Relations for . American Mathematical Monthly . 45 . 10 . 657–664 Published by: Mathematical Association of America . 2302434 . 10.1080/00029890.1938.11990873 . 21 February 2023 . 7 March 2023 . https://web.archive.org/web/20230307164817/https://www.maa.org/sites/default/files/pdf/pubs/amm_supplements/Monthly_Reference_7.pdf . dead .
39. Book: Roy, Ranjan . 2021 . 1st ed. 2011 . Series and Products in the Development of Mathematics . 2 . 1 . Cambridge University Press . 215–216, 219–220.

    Book: Newton, Isaac . Isaac Newton

    . Isaac Newton . 1971 . Whiteside . Derek Thomas . Tom Whiteside . The Mathematical Papers of Isaac Newton . 4, 1674–1684 . Cambridge University Press . 526–653 .

40. Web site: Sandifer . Ed . 2009 . Estimating π . How Euler Did It . Reprinted in Book: Sandifer, Ed . 0 . 2014 . How Euler Did Even More . 109–118 . Mathematical Association of America.

    Book: Euler, Leonhard . Leonhard Euler

    . Leonhard Euler . 1755 . . §2.2.30 . 318 . Academiae Imperialis Scientiarium Petropolitanae . la . https://archive.org/details/institutiones-calculi-differentialis-cum-eius-vsu-in-analysi-finitorum-ac-doctri/page/318 . E 212.

    Euler . Leonhard . Leonhard Euler . 1798 . written 1779 . Investigatio quarundam serierum, quae ad rationem peripheriae circuli ad diametrum vero proxime definiendam maxime sunt accommodatae . Nova Acta Academiae Scientiarum Petropolitinae . 11 . 133–149, 167–168 . E 705 .

    Chien-Lih . Hwang . 2004 . 88.38 Some Observations on the Method of Arctangents for the Calculation of . Mathematical Gazette . 88 . 512 . 270–278 . 10.1017/S0025557200175060 . 123532808 .

    Chien-Lih . Hwang . 2005 . 89.67 An elementary derivation of Euler's series for the arctangent function . Mathematical Gazette . 89 . 516 . 469–470 . 10.1017/S0025557200178404 . 123395287 .

41. Hayes . Brian . Pencil, Paper, and Pi . 102 . 5 . 342 . . September 2014 . 22 January 2022 . 10.1511/2014.110.342.
42. Borwein . J.M. . Borwein . P.B. . Ramanujan and Pi . 1988 . Scientific American . 256 . 2 . 112–117 . 1988SciAm.258b.112B . 10.1038/scientificamerican0288-112.
43. Borwein . J.M. . Borwein . P.B. . Dilcher . K. . 1989 . Pi, Euler Numbers, and Asymptotic Expansions . American Mathematical Monthly . 96 . 8 . 681–687 . 10.2307/2324715 . 2324715. 1959.13/1043679 . free .
44. Book: Wells, David . 35 . The Penguin Dictionary of Curious and Interesting Numbers . revised . Penguin . 1997 . 978-0-14-026149-3.
45. Lambert, Johann, "Mémoire sur quelques propriétés remarquables des quantités transcendantes circulaires et logarithmiques", reprinted in
46. Lindemann . F. . Ferdinand Lindemann . 1882 . Über die Ludolph'sche Zahl . Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin . 2 . 679–682 .
47. Hardy and Wright 1938 and 2000: 177 footnote § 11.13–14 references Lindemann's proof as appearing at Math. Ann. 20 (1882), 213–225.
48. cf Hardy and Wright 1938 and 2000:177 footnote § 11.13–14. The proofs that e and π are transcendental can be found on pp. 170–176. They cite two sources of the proofs at Landau 1927 or Perron 1910; see the "List of Books" at pp. 417–419 for full citations.
49. Book: Oughtred, William . Theorematum in libris Archimedis de sphaera et cylindro declarario . 1652 . Excudebat L. Lichfield, Veneunt apud T. Robinson . la . :: semidiameter. semiperipheria.
50. Book: Cajori, Florian . A History of Mathematical Notations: Vol. II . 2007 . Cosimo, Inc. . 978-1-60206-714-1 . 8–13 . en . the ratio of the length of a circle to its diameter was represented in the fractional form by the use of two letters ... J.A. Segner ... in 1767, he represented by, as did Oughtred more than a century earlier.
51. See p. 220: William Oughtred used the letter to represent the periphery (that is, the circumference) of a circle.
52. Book: Smith, David E. . History of Mathematics . 1958 . Courier Corporation . 978-0-486-20430-7 . 312 . en.
53. Archibald. R.C.. 1921. Historical Notes on the Relation . 2972388. The American Mathematical Monthly. 28. 3. 116–121. 10.2307/2972388. It is noticeable that these letters are never used separately, that is, is not used for 'Semiperipheria'.
54. See, for example, Book: Oughtred, William . Clavis Mathematicæ . 1648 . Thomas Harper . London . 69 . la. The key to mathematics. (English translation: Book: Oughtred, William . Key of the Mathematics . 1694 . J. Salusbury . en.)
55. Book: Barrow, Isaac . https://archive.org/stream/mathematicalwor00whewgoog#page/n405/mode/1up . The mathematical works of Isaac Barrow . 1860 . Cambridge University press . Harvard University . Whewell. William . 381 . la . Lecture XXIV.
56. Gregorius . David . 1695 . Ad Reverendum Virum D. Henricum Aldrich S.T.T. Decanum Aedis Christi Oxoniae . 102382 . Philosophical Transactions . la . 19 . 231 . 637–652 . 10.1098/rstl.1695.0114 . 1695RSPT...19..637G. free.
57. Book: Segner, Joannes Andreas . Cursus Mathematicus . 1756 . Halae Magdeburgicae . 282 . la. 15 October 2017. https://web.archive.org/web/20171015150340/https://books.google.co.uk/books?id=NmYVAAAAQAAJ&pg=PA282. 15 October 2017. live.
58. Euler . Leonhard . 1727 . Tentamen explicationis phaenomenorum aeris. Commentarii Academiae Scientiarum Imperialis Petropolitana . la . 2 . 351 . E007 . Sumatur pro ratione radii ad peripheriem, . 15 October 2017. https://web.archive.org/web/20160401072718/http://eulerarchive.maa.org/docs/originals/E007.pdf#page=5. 1 April 2016. live. English translation by Ian Bruce : " is taken for the ratio of the radius to the periphery [note that in this work, Euler's {{pi}} is double our {{pi}}.]"
59. Book: Euler, Leonhard . Lettres inédites d'Euler à d'Alembert . Bullettino di Bibliografia e di Storia delle Scienze Matematiche e Fisiche . 1747 . Henry. Charles . 19 . 1886 . 139 . fr . E858 . Car, soit π la circonference d'un cercle, dout le rayon est . English translation in Cajori . Florian . 1913 . History of the Exponential and Logarithmic Concepts . 2973441 . The American Mathematical Monthly . 20 . 3 . 75–84 . 10.2307/2973441 . Letting be the circumference (!) of a circle of unit radius.
60. Book: Euler, Leonhard. Mechanica sive motus scientia analytice exposita. (cum tabulis). 1736. Academiae scientiarum Petropoli. 1. 113. la. Ch. 3 Prop. 34 Cor. 1. E015. Denotet rationem diametri ad peripheriam. https://books.google.com/books?id=jgdTAAAAcAAJ&pg=PA113. English translation by Ian Bruce : "Let denote the ratio of the diameter to the circumference"
61. Book: Euler, Leonhard (1707–1783) . Leonhardi Euleri opera omnia. 1, Opera mathematica. Volumen VIII, Leonhardi Euleri introductio in analysin infinitorum. Tomus primus / ediderunt Adolf Krazer et Ferdinand Rudio . 1922 . B.G. Teubneri . Lipsae . 133–134 . la . E101. 15 October 2017. https://web.archive.org/web/20171016022758/http://gallica.bnf.fr/ark:/12148/bpt6k69587/f155. 16 October 2017. live.
62. Book: Segner, Johann Andreas von . Cursus Mathematicus: Elementorum Analyseos Infinitorum Elementorum Analyseos Infinitorvm . 1761 . Renger . 374 . la . Si autem notet peripheriam circuli, cuius diameter eſt .
63. Reitwiesner . George . An ENIAC Determination of pi and e to 2000 Decimal Places . Mathematical Tables and Other Aids to Computation . 1950 . 4 . 29 . 11–15 . 10.2307/2002695 . 2002695.
64. J. C.. Nicholson. J. . Jeenel. Math. Tabl. Aids. Comp.. 9. 52. 1955. 10.2307/2002052. 2002052. Some comments on a NORC Computation of π. 162–164.
65. . For details of algorithms, see Book: Borwein . Jonathan. Borwein . Peter. Pi and the AGM: a Study in Analytic Number Theory and Computational Complexity . Wiley . 1987 . 978-0-471-31515-5 .
66. Web site: Bailey . David H. . Some Background on Kanada's Recent Pi Calculation . 16 May 2003 . 12 April 2012. live . https://web.archive.org/web/20120415102439/http://crd-legacy.lbl.gov/~dhbailey/dhbpapers/dhb-kanada.pdf . 15 April 2012.
67. News: John W. Wrench, Jr.: Mathematician Had a Taste for Pi . Matt . Schudel . The Washington Post . 25 March 2009 . B5.
68. News: The Big Question: How close have we come to knowing the precise value of pi? . The Independent . 8 January 2010 . 14 April 2012 . London . Steve . Connor. live . https://web.archive.org/web/20120402220803/http://www.independent.co.uk/news/science/the-big-question-how-close-have-we-come-to-knowing-the-precise-value-of-pi-1861197.html . 2 April 2012.
69. Book: Bailey. David H.. David H. Bailey (mathematician). Borwein. Jonathan M.. Jonathan Borwein. 15.2 Computational records. https://books.google.com/books?id=K26zDAAAQBAJ&pg=PA469. 10.1007/978-3-319-32377-0. 469. Springer International Publishing. Pi: The Next Generation, A Sourcebook on the Recent History of Pi and Its Computation. 2016. 978-3-319-32375-6 .
70. How Google's Emma Haruka Iwao Helped Set a New Record for Pi . 11 June 2022. The New Stack. David. Cassel.
71. PSLQ means Partial Sum of Least Squares.
72. Web site: Simon . Plouffe . Simon Plouffe . [<!-- http://www.lacim.uqam.ca/~plouffe/inspired2.pdf -->http://plouffe.fr/simon/inspired2.pdf Identities inspired by Ramanujan's Notebooks (part 2) ]. April 2006 . 10 April 2009. live . https://web.archive.org/web/20120114101641/http://www.plouffe.fr/simon/inspired2.pdf . 14 January 2012.
73. Ramaley . J.F. . Buffon's Noodle Problem . 2317945 . The American Mathematical Monthly . 76 . 8 . October 1969 . 916–918 . 10.2307/2317945.
74. Grünbaum . B. . Branko Grünbaum . Projection Constants . . 95 . 3 . 451–465 . 1960 . 10.1090/s0002-9947-1960-0114110-9. free.
75. Gibbons. Jeremy. Jeremy Gibbons. 10.2307/27641917. 4. The American Mathematical Monthly. 27641917. 2211758. 318–328. Unbounded spigot algorithms for the digits of pi. 113. 2006.
76. Stanley . Rabinowitz . Wagon . Stan . March 1995 . A spigot algorithm for the digits of Pi . American Mathematical Monthly . 102 . 3 . 195–203 . 10.2307/2975006 . 2975006.
77. Bailey . David H. . David H. Bailey (mathematician) . Borwein . Peter B. . Peter Borwein . Plouffe . Simon . Simon Plouffe . April 1997 . [<!-- http://crd.lbl.gov/~dhbailey/dhbpapers/digits.pdf -->http://crd-legacy.lbl.gov/~dhbailey/dhbpapers/digits.pdf On the Rapid Computation of Various Polylogarithmic Constants ]. Mathematics of Computation . 66 . 218 . 903–913 . 10.1090/S0025-5718-97-00856-9 . live . https://web.archive.org/web/20120722015837/http://crd-legacy.lbl.gov/~dhbailey/dhbpapers/digits.pdf . 22 July 2012 . 10.1.1.55.3762 . 1997MaCom..66..903B. 6109631 .
78. Bellards formula in: Web site: A new formula to compute the n^th binary digit of pi . Fabrice . Bellard . Fabrice Bellard . 27 October 2007 . https://web.archive.org/web/20070912084453/http://fabrice.bellard.free.fr/pi/pi_bin/pi_bin.html . 12 September 2007.
79. News: Pi record smashed as team finds two-quadrillionth digit . Palmer . Jason . BBC News . 16 September 2010 . 26 March 2011 . live . https://web.archive.org/web/20110317170643/http://www.bbc.co.uk/news/technology-11313194 . 17 March 2011.
80. Plouffe . Simon . 2022 . 2201.12601 . A formula for the th decimal digit or binary of and powers of . math.NT .
81. Book: Martini. Horst. Montejano. Luis. Oliveros. Déborah. Déborah Oliveros. 10.1007/978-3-030-03868-7. 978-3-030-03866-3. 3930585. Birkhäuser. 127264210. Bodies of Constant Width: An Introduction to Convex Geometry with Applications. 2019. See Barbier's theorem, Corollary 5.1.1, p. 98; Reuleaux triangles, pp. 3, 10; smooth curves such as an analytic curve due to Rabinowitz, § 5.3.3, pp. 111–112.
82. Book: Herman. Edwin. Strang. Gilbert. Gilbert Strang. Section 5.5, Exercise 316. https://openstax.org/books/calculus-volume-1/pages/5-5-substitution. 594. OpenStax. Calculus. 1. 2016.
83. Book: Hilbert . David . David Hilbert . Courant . Richard . Richard Courant . Methods of mathematical physics, volume 1 . 286–290 . 1966 . Wiley.
84. Book: Chavel, Isaac . Isoperimetric inequalities . Cambridge University Press . 2001.
85. Talenti. Giorgio . Best constant in Sobolev inequality . Annali di Matematica Pura ed Applicata . 110 . 1 . 353–372 . 1618-1891 . 10.1007/BF02418013 . 10.1.1.615.4193 . 1976. 16923822 .
86. Best constants in Poincaré inequalities for convex domains . 1110.2960 . L. Esposito . C. Nitsch . C. Trombetti . 2011 . math.AP.
87. Best constants for Gagliardo–Nirenberg inequalities and applications to nonlinear diffusions . M.. Del Pino . J.. Dolbeault . Journal de Mathématiques Pures et Appliquées . 2002 . 81 . 9 . 847–875 . 10.1016/s0021-7824(02)01266-7 . 10.1.1.57.7077. 8409465 .
88. Payne . L.E. . Weinberger . H.F. . An optimal Poincaré inequality for convex domains . 1960 . Archive for Rational Mechanics and Analysis . 5 . 1 . 0003-9527 . 286–292 . 10.1007/BF00252910 . 1960ArRMA...5..286P. 121881343 .
89. Book: Folland, Gerald. Harmonic analysis in phase space . Princeton University Press . 1989 . 5. Gerald Folland.
90. Roger . Howe . On the role of the Heisenberg group in harmonic analysis . . 3 . 821–844 . 2 . 1980 . 10.1090/S0273-0979-1980-14825-9 . 578375. free.
91. Feller, W. An Introduction to Probability Theory and Its Applications, Vol. 1, Wiley, 1968, pp. 174–190.
92. Book: Elias. Stein . Guido. Weiss . Fourier analysis on Euclidean spaces . 1971 . Princeton University Press . 6. Elias Stein.

    Theorem 1.13.

93. Book: Spivak, Michael. A Comprehensive Introduction to Differential Geometry . 3 . 1999 . Publish or Perish Press. Michael Spivak.

    Chapter 6.

94. Book: Kobayashi . Shoshichi . Nomizu . Katsumi . Foundations of Differential Geometry . 2 . . 1996 . New . 293. Foundations of Differential Geometry.

    Chapter XII Characteristic classes

95. Book: Ahlfors, Lars. Complex analysis . McGraw-Hill . 1966 . 115. Lars Ahlfors.
96. Book: Joglekar, S. D.. Mathematical Physics. Universities Press. 2005. 166. 978-81-7371-422-1.
97. Book: Schey, H. M.. 1996. Div, Grad, Curl, and All That: An Informal Text on Vector Calculus. W.W. Norton . 0-393-96997-5.
98. Book: Yeo, Adrian. The pleasures of pi, e and other interesting numbers. World Scientific Pub.. 2006. 21. 978-981-270-078-0.
99. Book: Ehlers, Jürgen. Einstein's Field Equations and Their Physical Implications. Springer. 2000. 7. 978-3-540-67073-5.
100. Book: Artin, Emil. The Gamma Function . Holt, Rinehart and Winston . 1964 . Athena series; selected topics in mathematics . 1st. Emil Artin.
101. Book: Evans, Lawrence. Partial Differential Equations . AMS . 1997 . 615.
102. Benjamin Nill . Andreas Paffenholz . On the equality case in Erhart's volume conjecture . 2014 . 1205.1270 . Advances in Geometry . 14 . 4 . 579–586 . 1615-7168 . 10.1515/advgeom-2014-0001. 119125713 .
103. This theorem was proved by Ernesto Cesàro in 1881. For a more rigorous proof than the intuitive and informal one given here, see Book: Hardy, G. H.. An Introduction to the Theory of Numbers. Oxford University Press. 2008. 978-0-19-921986-5. Theorem 332.
104. Book: C. Stanley Ogilvy. Ogilvy. C. S.. Anderson. J. T.. Excursions in Number Theory. Dover Publications Inc.. 1988. 29–35. 0-486-25778-9.
105. Book: Algebraic Groups and Number Theory . Vladimir. Platonov . Andrei . Rapinchuk . Academic Press . 1994 . 262–265.
106. Sondow. J. . Analytic continuation of Riemann's zeta function and values at negative integers via Euler's transformation of series . . 120 . 2 . 421–424 . 1994 . 10.1090/s0002-9939-1994-1172954-7 . 10.1.1.352.5774. 122276856 .
107. 10.1063/1.4930800 . T. Friedmann . C.R. Hagen . Quantum mechanical derivation of the Wallis formula for pi . Journal of Mathematical Physics . 56 . 11 . 112101 . 2015 . 1510.07813 . 2015JMP....56k2101F. 119315853 .
108. Book: Mumford, David . David Mumford . Tata Lectures on Theta I . 1983 . Birkhauser . Boston . 978-3-7643-3109-2 . 1–117.
109. Book: Sidney. Port . Charles. Stone . Brownian motion and classical potential theory . Academic Press . 1978 . 29.
110. Book: Titchmarsh, E. . Edward Charles Titchmarsh . Introduction to the Theory of Fourier Integrals . 978-0-8284-0324-5 . 1948 . 2nd. 1986 . Clarendon Press . Oxford University.
111. Book: Stein, Elias . Elias Stein . Singular Integrals and Differentiability Properties of Functions . Princeton University Press . 1970.

     Chapter II.

112. Klebanoff . Aaron . 2001 . Pi in the Mandelbrot set . Fractals . 9 . 4 . 393–402 . https://web.archive.org/web/20111027155739/http://home.comcast.net/~davejanelle/mandel.pdf . 27 October 2011 . 14 April 2012 . 10.1142/S0218348X01000828 . dead .
113. Book: Peitgen, Heinz-Otto. Chaos and fractals: new frontiers of science. Springer. 2004. 801–803. 978-0-387-20229-7.
114. Book: Projective Differential Geometry Old and New: From the Schwarzian Derivative to the Cohomology of Diffeomorphism Groups . Cambridge Tracts in Mathematics . Cambridge University Press . 2004 . 978-0-521-83186-4 . V.. Ovsienko. S.. Tabachnikov. Section 1.3.
115. Book: Halliday. David. Resnick. Robert. Walker. Jearl. Fundamentals of Physics. 5th. John Wiley & Sons. 1997. 381. 0-471-14854-7.
116. Book: College Physics 2e. 29.7 Probability: The Heisenberg Uncertainty Principle. https://openstax.org/books/college-physics-2e/pages/29-7-probability-the-heisenberg-uncertainty-principle. OpenStax. Paul Peter. Urone. Roger. Hinrichs. 2022.
117. Book: Itzykson . C. . Claude Itzykson . Zuber . J.-B. . Jean-Bernard Zuber . Quantum Field Theory . 1980 . Dover Publications . Mineola, NY . 978-0-486-44568-7 . 2005 . 2005053026 . 61200849.
118. Book: Low, Peter. Classical Theory of Structures Based on the Differential Equation. Cambridge University Press. 1971. 116–118. 978-0-521-08089-7.
119. Book: Batchelor, G. K.. An Introduction to Fluid Dynamics. Cambridge University Press. 1967. 233. 0-521-66396-2.
120. http://www.guinnessworldrecords.com/world-records/most-pi-places-memorised "Most Pi Places Memorized"
121. News: Tomoko . Otake . [<!-- http://www.lacim.uqam.ca/~plouffe/inspired2.pdf -->http://www.japantimes.co.jp/life/2006/12/17/general/how-can-anyone-remember-100000-numbers/ How can anyone remember 100,000 numbers? ]. . 17 December 2006 . 27 October 2007. live . https://web.archive.org/web/20130818004142/http://www.japantimes.co.jp/life/2006/12/17/life/how-can-anyone-remember-100000-numbers/ . 18 August 2013.
122. Book: Danesi, Marcel. Chapter 4: Pi in Popular Culture. January 2021. 10.1163/9789004433397. 97. Brill. Pi in Nature, Art, and Culture. 9789004433373 . 224869535 .
123. Raz . A. . Packard . M.G. . 2009 . A slice of pi: An exploratory neuroimaging study of digit encoding and retrieval in a superior memorist . Neurocase . 15 . 5 . 361–372 . 10.1080/13554790902776896 . 19585350 . 4323087.
124. Web site: Mike . Keith . Mike Keith (mathematician) . Cadaeic Cadenza Notes & Commentary . 29 July 2009. live . https://web.archive.org/web/20090118060210/http://cadaeic.net/comments.htm . 18 January 2009.
125. Book: Keith, Michael . Not A Wake: A dream embodying (pi)'s digits fully for 10,000 decimals . Vinculum Press . 978-0-9630097-1-5 . Diana Keith . 17 February 2010.
126. For instance, Pickover calls π "the most famous mathematical constant of all time", and Peterson writes, "Of all known mathematical constants, however, pi continues to attract the most attention", citing the Givenchy π perfume, Pi (film), and Pi Day as examples. See: Book: Pickover, Clifford A. . Keys to Infinity . Clifford A. Pickover . Wiley & Sons . 1995 . 978-0-471-11857-2 . 59 . Book: Peterson, Ivars . Mathematical Treks: From Surreal Numbers to Magic Circles . MAA spectrum . Ivars Peterson . Mathematical Association of America . 2002 . 978-0-88385-537-9 . 17 . live . https://web.archive.org/web/20161129190818/https://books.google.com/books?id=4gWSAraVhtAC&pg=PA17 . 29 November 2016.
127. Book: Burkard . Polster . Marty . Ross . Burkard Polster . Math Goes to the Movies . 2012 . 978-1-421-40484-4 . Johns Hopkins University Press . 56–57.
128. Review of Aerial . Andy . Gill . . 4 November 2005 . the almost autistic satisfaction of the obsessive-compulsive mathematician fascinated by 'Pi' (which affords the opportunity to hear Bush slowly sing vast chunks of the number in question, several dozen digits long). live . https://web.archive.org/web/20061015122229/http://gaffa.org/reaching/rev_aer_UK5.html . 15 October 2006.
129. Rubillo. James M.. January 1989. 1. The Mathematics Teacher. 27966082. 10. Disintegrate 'em. 82.
130. Book: Petroski, Henry. Henry Petroski. 978-1-139-50530-7. 47. Cambridge University Press. Title An Engineer's Alphabet: Gleanings from the Softer Side of a Profession. 2011.
131. News: Happy Pi Day! Watch these stunning videos of kids reciting 3.14 . USAToday.com . 14 March 2015 . 14 March 2015 . live . https://web.archive.org/web/20150315005038/http://www.usatoday.com/story/news/nation-now/2015/03/14/pi-day-kids-videos/24753169/ . 15 March 2015.
132. Pi Instant . Rosenthal . Jeffrey S. . February 2015 . 22 . Math Horizons. 22 . 3 . 10.4169/mathhorizons.22.3.22 . 218542599 .
133. Web site: Griffin . Andrew . Pi Day: Why some mathematicians refuse to celebrate 14 March and won't observe the dessert-filled day . The Independent . 2 February 2019 . https://web.archive.org/web/20190424151944/https://www.independent.co.uk/news/science/pi-day-march-14-maths-google-doodle-pie-baking-celebrate-30-anniversary-a8254036.html . 24 April 2019 . live.
134. Book: Freiberger. Marianne. Thomas. Rachel. Tau – the new . https://books.google.com/books?id=IbR-BAAAQBAJ&pg=PT133. 978-1-62365-411-5. 159. Quercus. Numericon: A Journey through the Hidden Lives of Numbers. 2015.
135. Abbott . Stephen . My Conversion to Tauism . Math Horizons . April 2012 . 19 . 4 . 34 . 10.4169/mathhorizons.19.4.34 . 126179022 . live . https://web.archive.org/web/20130928095819/http://www.maa.org/sites/default/files/pdf/Mathhorizons/apr12_aftermath.pdf . 28 September 2013.
136. Palais . Robert . Is Wrong!. The Mathematical Intelligencer. 2001. 23. 3. 7–8. 10.1007/BF03026846. 120965049 . live. https://web.archive.org/web/20120622070009/http://www.math.utah.edu/~palais/pi.pdf. 22 June 2012.
137. Life of pi in no danger – Experts cold-shoulder campaign to replace with tau . Telegraph India . 30 June 2011. dead . https://web.archive.org/web/20130713084345/http://www.telegraphindia.com/1110630/jsp/nation/story_14178997.jsp . 13 July 2013.
138. Web site: Forget Pi Day. We should be celebrating Tau Day Science News . 2023-05-02 . en-US.
139. Hallerberg . Arthur . May 1977 . Indiana's squared circle . Mathematics Magazine . 50 . 3 . 136–140 . 2689499 . 10.2307/2689499.
140. The Future of TeX and Metafont . Donald . Knuth . Donald Knuth . TeX Mag . 5 . 1 . 145 . 3 October 1990 . 17 February 2017. live . https://web.archive.org/web/20160413230304/http://www.ntg.nl/maps/05/34.pdf . 13 April 2016.
141. Web site: PEP 628 – Add math.tau.
142. Web site: Crate tau . 2022-12-06.