Pi

src: media.wired.com

The number ? () is a mathematical constant. Originally defined as the ratio of a circle's circumference to its diameter, it now has various equivalent definitions and appears in many formulas in all areas of mathematics and physics. It is approximately equal to 3.14159. It has been represented by the Greek letter "?" since the mid-18th century, though it is also sometimes spelled out as "pi".

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

Ancient civilizations required fairly accurate computed values for ? for practical reasons. It was calculated to seven digits, using geometrical techniques, in Chinese mathematics, and to about five digits in Indian mathematics in the 5th century AD. The historically first exact formula for ?, based on infinite series, was not available until a millennium later, when in the 14th century the Madhava-Leibniz series was discovered in Indian mathematics. In the 20th and 21st centuries, mathematicians and computer scientists discovered new approaches that, when combined with increasing computational power, extended the decimal representation of ? to many trillions of digits after the decimal point. Practically all scientific applications require no more than a few hundred digits of ?, and many substantially fewer, so the primary motivation for these computations is the quest to find more efficient algorithms for calculating lengthy numeric series, as well as the desire to break records. The extensive calculations involved have also been used to test supercomputers and high-precision multiplication algorithms.

Because its most elementary definition relates to the circle, ? is found in many formulae in trigonometry and geometry, especially those concerning circles, ellipses, and spheres. In more modern mathematical analysis, the number is instead defined using the spectral properties of the real number system, as an eigenvalue or a period, without any reference to geometry. It appears therefore in areas of mathematics and the sciences having little to do with the geometry of circles, such as number theory and statistics, as well as in almost all areas of physics. The ubiquity of ? makes it one of the most widely known mathematical constants both inside and outside the scientific community; several books devoted to it have been published, the number is celebrated on Pi Day, and record-setting calculations of the digits of ? often result in news headlines. Attempts to memorize the value of ? with increasing precision have led to records of over 70,000 digits.

Video Pi

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, and derived from the first letter of the Greek word perimetros, meaning circumference. In English, ? is pronounced as "pie" (, pa?). In mathematical use, the lowercase letter ? (or ? in sans-serif font) 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 C to its diameter d:

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

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

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

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

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

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

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

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

and there is a unique positive real number ? with this property. A more abstract variation on the same idea, making use of sophisticated mathematical concepts of topology and algebra, is the following theorem: there is a unique (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.

A circle encloses the largest area that can be attained within a given perimeter. Thus the number ? is also characterized as the best constant in the isoperimetric inequality (times one-fourth). There are many other, closely related, ways in which ? appears as an eigenvalue of some geometrical or physical process; see below.

Irrationality and normality

? is an irrational number, meaning that it cannot be written as the ratio of two integers (fractions such as 22/7 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 it 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 e or ln(2) but smaller than the measure of Liouville numbers.

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

In addition to being irrational, more strongly ? is a transcendental number, which means that it is not the solution of any non-constant polynomial equation with rational coefficients, such as x⁵/120 - x³/6 + 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 ³?31 or ?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 sometimes claim success despite the fact that it is mathematically impossible.

Continued fractions

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

${\displaystyle \pi =3+\textstyle {\cfrac {1}{7+\textstyle {\cfrac {1}{15+\textstyle {\cfrac {1}{1+\textstyle {\cfrac {1}{292+\textstyle {\cfrac {1}{1+\textstyle {\cfrac {1}{1+\textstyle {\cfrac {1}{1+\ddots }}}}}}}}}}}}}}}$

Truncating the continued fraction at any point yields a rational approximation for ?; the first four of these are 3, 22/7, 333/106, and 355/113. These numbers are among the most well-known and widely used historical approximations of the constant. Each approximation generated in this way is a best rational approximation; that is, each is closer to ? than any other fraction with the same or a smaller denominator. Because ? is known to be 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, mathematicians have discovered several generalized continued fractions that do, such as:

${\displaystyle {\begin{aligned}\pi &=\textstyle {\cfrac {4}{1+\textstyle {\cfrac {1^{2}}{2+\textstyle {\cfrac {3^{2}}{2+\textstyle {\cfrac {5^{2}}{2+\textstyle {\cfrac {7^{2}}{2+\textstyle {\cfrac {9^{2}}{2+\ddots }}}}}}}}}}}}=3+\textstyle {\cfrac {1^{2}}{6+\textstyle {\cfrac {3^{2}}{6+\textstyle {\cfrac {5^{2}}{6+\textstyle {\cfrac {7^{2}}{6+\textstyle {\cfrac {9^{2}}{6+\ddots }}}}}}}}}}\\[8pt]&=\textstyle {\cfrac {4}{1+\textstyle {\cfrac {1^{2}}{3+\textstyle {\cfrac {2^{2}}{5+\textstyle {\cfrac {3^{2}}{7+\textstyle {\cfrac {4^{2}}{9+\ddots }}}}}}}}}}\end{aligned}}}$

Approximate value

Some approximations of pi include:

• Integers: 3
• Fractions: Approximate fractions include (in order of increasing accuracy) 22/7, 333/106, 355/113, 52163/16604, 103993/33102, and 245850922/78256779. (List is selected terms from A063674 and A063673.)
• Decimal: The first 50 decimal digits are 3.14159265358979323846264338327950288419716939937510... (see A000796)
• Binary: The base 2 approximation to 48 digits is 11.001001000011111101101010100010001000010110100011... (see A004601)
• Hexadecimal: The base 16 approximation to 20 digits is 3.243F6A8885A308D31319... (see A062964)
• Sexagesimal: A base 60 approximation to five sexagesimal digits is 3;8,29,44,0,47 (see A060707)

Complex numbers and Euler's identity

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

${\displaystyle z=r\cdot (\cos \varphi +i\sin \varphi ),}$

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

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

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

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

There are n different complex numbers z satisfying zⁿ = 1, and these are called the "n-th roots of unity". They are given by this formula:

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

Maps Pi

History

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.

Some Egyptologists have claimed that the ancient Egyptians used an approximation of ? as 22/7 from as early as the Old Kingdom. This claim has met with skepticism.

The earliest written approximations of ? are found in Egypt and Babylon, both within one percent of the true value. In Babylon, a clay tablet dated 1900-1600 BC has a geometrical statement that, by implication, treats ? as 25/8 = 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 (16/9)² ? 3.1605.

Astronomical calculations in the Shatapatha Brahmana (ca. 4th century BC) use a fractional approximation of 339/108 ? 3.139 (an accuracy of 9×10^-4). Other Indian sources by about 150 BC treat ? as ?10 ? 3.1622.

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. This polygonal algorithm dominated for over 1,000 years, and as a result ? is sometimes referred to as "Archimedes' 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 223/71 < ? < 22/7 (that is 3.1408 < ? < 3.1429). Archimedes' upper bound of 22/7 may have led to a widespread popular belief that ? is equal to 22/7. 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.

In ancient China, values for ? included 3.1547 (around 1 AD), ?10 (100 AD, approximately 3.1623), and 142/45 (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 ? ? 355/113 (a fraction that goes by the name Milü in Chinese), using Liu Hui's algorithm applied to a 12,288-sided polygon. With a correct value for its seven first decimal digits, this value of 3.141592920... remained the most accurate approximation of ? available for the next 800 years.

The Indian astronomer Aryabhata used a value of 3.1416 in his ?ryabha??ya (499 AD). Fibonacci in c. 1220 computed 3.1418 using a polygonal method, independent of Archimedes. Italian author Dante apparently employed the value 3+?2/10 ? 3.14142.

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

Infinite series

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 was first discovered in India sometime between 1400 and 1500 AD. The first written description of an infinite series that could be used to compute ? was laid out in Sanskrit verse by Indian astronomer Nilakantha Somayaji in his Tantrasamgraha, around 1500 AD. The series are presented without proof, but proofs are presented in a later Indian work, Yuktibh???, from around 1530 AD. Nilakantha attributes the series to an earlier Indian mathematician, Madhava of Sangamagrama, who lived c. 1350 - c. 1425. Several infinite series are described, including series for sine, tangent, and cosine, which are now referred to as the Madhava series or Gregory-Leibniz series. Madhava used infinite series to estimate ? to 11 digits around 1400, but that value was improved on around 1430 by the Persian mathematician Jamsh?d al-K?sh?, using a polygonal algorithm.

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

${\displaystyle {\frac {2}{\pi }}={\frac {\sqrt {2}}{2}}\cdot {\frac {\sqrt {2+{\sqrt {2}}}}{2}}\cdot {\frac {\sqrt {2+{\sqrt {2+{\sqrt {2}}}}}}{2}}\cdots }$

The second infinite sequence found in Europe, by John Wallis in 1655, was also an infinite product:

${\displaystyle {\frac {\pi }{2}}={\frac {2}{1}}\cdot {\frac {2}{3}}\cdot {\frac {4}{3}}\cdot {\frac {4}{5}}\cdot {\frac {6}{5}}\cdot {\frac {6}{7}}\cdot {\frac {8}{7}}\cdot {\frac {8}{9}}\cdots }$

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

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

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

This formula, the Gregory-Leibniz series, equals ?/4 when evaluated with z = 1. In 1699, English mathematician Abraham Sharp used the Gregory-Leibniz series for ${\displaystyle z={\frac {1}{\sqrt {3}}}}$ to compute ? to 71 digits, breaking the previous record of 39 digits, which was set with a polygonal algorithm. The Gregory-Leibniz for ${\displaystyle z=1}$ series is simple, but converges very slowly (that is, approaches the answer gradually), so it is not used in modern ? calculations.

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

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

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 ?. 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.

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

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. A simple infinite series for ? is the Gregory-Leibniz series:

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

As individual terms of this infinite series are added to the sum, the total gradually gets closer to ?, 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 ?.

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

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

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

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 of ?. 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:

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

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

Adoption of the symbol ?

In the earliest usages, the Greek letter ? was an abbreviation of the Greek word for periphery (??????????), and was combined in ratios with ? (for diameter) or ? (for radius) to form circle constants. (Before then, mathematicians sometimes used letters such as c or p instead.) The first recorded use is Oughtred's "?.?", to express the ratio of periphery and diameter in the 1647 and later editions of Clavis Mathematicae. Barrow likewise used "${\textstyle {\frac {\pi }{\delta }}}$" to represent the constant 3.14..., while Gregory instead used "${\textstyle {\frac {\pi }{\rho }}}$" to represent 6.28....

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 Synopsis Palmariorum Matheseos; or, a New Introduction to the Mathematics. The Greek letter first appears there in the phrase "1/2 Periphery (?)" in the discussion of a circle with radius one. However, he 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.

Euler started using the single-letter form beginning with his 1727 Essay Explaining The Properties Of Air, though he used ? = 6.28..., the ratio of radius to periphery, in this and some later writing. Euler first used ?=3.14... in his 1736 work Mechanica, and continued in his widely-read 1748 work Introductio in analysin infinitorum (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 1"). 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.

src: wallpaperswide.com

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 ?. American mathematicians John Wrench and Levi Smith reached 1,120 digits in 1949 using a desk calculator. Using an inverse tangent (arctan) infinite series, a team led by George Reitwiesner and John von Neumann that same year achieved 2,037 digits with a calculation that took 70 hours of computer time on the ENIAC computer. The record, always relying on an arctan series, was broken repeatedly (7,480 digits in 1957; 10,000 digits in 1958; 100,000 digits in 1961) until 1 million digits were reached in 1973.

Two additional developments around 1980 once again accelerated the ability to compute ?. 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 American physicist Eugene Salamin and Australian scientist Richard Brent. These avoid reliance on infinite series. An iterative algorithm repeats a specific calculation, each iteration using the outputs from prior steps as its inputs, and produces a result in each step that converges to the desired value. The approach was actually invented over 160 years earlier by Carl Friedrich Gauss, in what is now termed the arithmetic-geometric mean method (AGM method) or Gauss-Legendre algorithm. As modified by Salamin and Brent, it is also referred to as the Brent-Salamin algorithm.

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

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. 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. 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 the 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

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

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

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

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, 2.7 trillion (2.7×10¹²) digits by Fabrice Bellard in 2009, and 10 trillion (10¹³) digits in 2011 by Alexander Yee and Shigeru Kondo. For similar formulas, see also the Ramanujan-Sato series.

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

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

where q is e^? (Gelfond's constant), k is an odd number, and a, b, c are certain rational numbers that Plouffe computed.

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 l is dropped n times on a surface on which parallel lines are drawn t units apart, and if x of those times it comes to rest crossing a line (x > 0), then one may approximate ? based on the counts:

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

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 ?/4.

Another way to calculate ? using probability is to start with a random walk, generated by a sequence of (fair) coin tosses: independent random variables X_k such that X_k ? {-1,1} with equal probabilities. The associated random walk is

${\displaystyle W_{n}=\sum _{k=1}^{n}X_{k}}$

so that, for each n, W_n is drawn from a standard binomial distribution. As n varies W_n defines a (discrete) stochastic process. Then ? can be calculated by

${\displaystyle \pi =\lim _{n\to \infty }{\frac {2n}{E[|W_{n}|]^{2}}}.}$

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

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. This is in contrast to infinite series or iterative algorithms, which retain and use all intermediate digits until the final result is produced.

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

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

${\displaystyle \pi =\sum _{k=0}^{\infty }{\frac {1}{16^{k}}}\left({\frac {4}{8k+1}}-{\frac {2}{8k+4}}-{\frac {1}{8k+5}}-{\frac {1}{8k+6}}\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. Variations of the algorithm have been discovered, but no digit extraction algorithm has yet been found that rapidly produces decimal digits. An important application of digit extraction algorithms is to validate new claims of record ? computations: After a new record is claimed, the decimal result is converted to hexadecimal, and then a digit extraction algorithm is used to calculate several random hexadecimal digits near the end; if they match, this provides a measure of confidence that the entire computation is correct.

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

src: writescience.files.wordpress.com

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 r is 2?r.
• The area of a circle with radius r is ?r².
• The volume of a sphere with radius r is 4/3?r³.
• The surface area of a sphere with radius r is 4?r².

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.

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:

${\displaystyle \int _{-1}^{1}{\sqrt {1-x^{2}}}\,dx={\frac {\pi }{2}}.}$

In that integral the function ?1 - x² represents the top half of a circle (the square root is a consequence of the Pythagorean theorem), and the integral ?1
-1 computes the area between that half of a circle and the x axis.

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 1° = ?/180 radians.

Common trigonometric functions have periods that are multiples of ?; for example, sine and cosine have period 2?, so for any angle ? and any integer k,

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

Eigenvalues

Many of the appearances of ? in the formulas 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.

In many applications it plays a distinguished role as an eigenvalue. For example, an idealized vibrating string can be modelled as the graph of a function f on the unit interval [0,1], with fixed ends f(0) = f(1) = 0. The modes of vibration of the string are solutions of the differential equation f "(x) + ? f(x) = 0. Here ? is an associated eigenvalue, which is constrained by Sturm-Liouville theory to take on only certain specific values. It must be positive, since the second derivative is negative definite, so it is convenient to write ? = ?² where ? > 0 is called the wavenumber. Then f(x) = sin(? x) satisfies the boundary conditions and the differential equation with ? = ?.

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 obtain this is by estimating the energy. The energy satisfies an inequality, Wirtinger's inequality for functions, which states that if a function f : [0, 1] -> C is given such that f(0) = f(1) = 0 and f and f ' are both square integrable, then the inequality holds:

${\displaystyle \pi ^{2}\int _{0}^{1}|f(x)|^{2}\,dx\leq \int _{0}^{1}|f'(x)|^{2}\,dx,}$

and the case of equality holds precisely when f is a multiple of sin(? x). So ? appears as an optimal constant in Wirtinger's inequality, and from this it follows that it is the smallest such wavenumber, using the variational characterization of the eigenvalue. As a consequence, ? is the smallest singular value of the derivative on the space of functions on [0,1] vanishing at both endpoints (the Sobolev space ${\displaystyle H_{0}^{1}[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 A enclosed by a plane Jordan curve of perimeter P satisfies the inequality

${\displaystyle 4\pi A\leq P^{2},}$

and equality is clearly achieved for the circle, since in that case A = ?r² and P = 2?r.

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. In two dimensions, the critical Sobolev inequality is

${\displaystyle 2\pi \|f\|_{2}\leq \|\nabla f\|_{1}}$

for f a smooth function with compact support in R², ${\displaystyle \nabla f}$ is the gradient of f, and ${\displaystyle \|f\|_{2}}$ and ${\displaystyle \|\nabla f\|_{1}}$ refer respectively to the L² and L¹-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

${\displaystyle \pi \leq {\frac {\left(\int _{G}|\nabla u|^{2}\right)^{1/2}}{\left(\int _{G}|u|^{2}\right)^{1/2}}}}$

for all convex subsets G of Rⁿ of diameter 1, and square-integrable functions u on G of mean zero. 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 f on the real line to the function defined as:

${\displaystyle {\hat {f}}(\xi )=\int _{-\infty }^{\infty }f(x)e^{-2\pi ix\xi }\,dx.}$

There are several different conventions for the Fourier transform, all of which involve a factor of ? that is placed somewhere. The appearance of ? is essential in these formulas, as there is there is no possibility to remove ? altogether from the Fourier transform and its inverse transform. The definition given above is the most canonical however, because it describes the unique unitary operator on L² that is also an algebra homomorphism of L¹ to L^?.

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,

${\displaystyle \int _{-\infty }^{\infty }x^{2}|f(x)|^{2}\,dx\ \int _{-\infty }^{\infty }\xi ^{2}|{\hat {f}}(\xi )|^{2}\,d\xi \geq \left({\frac {1}{4\pi }}\int _{-\infty }^{\infty }|f(x)|^{2}\,dx\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.

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. The Gaussian function, which is the probability density function of the normal distribution with mean ? and standard deviation ?, naturally contains ?:

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

For this to be a probability density, the area under the graph of f needs to be equal to one. This follows from a change of variables in the Gaussian integral:

${\displaystyle \int _{-\infty }^{\infty }e^{-u^{2}}\,du={\sqrt {\pi }}}$

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 e^-?x2 equal to its own Fourier transform. Indeed, according to Howe (1980), the "whole business" of establishing the fundamental theorems of Fourier analysis reduces to the Gaussian integral.

Projective geometry

Let V be the set of all twice differentiable real functions ${\displaystyle f:\mathbb {R} \to \mathbb {R} }$ that satisfy the ordinary differential equation ${\displaystyle f''(x)+f(x)=0}$. Then V is a two-dimensional real vector space, with two parameters corresponding to a pair of initial conditions for the differential equation. For any ${\displaystyle t\in \mathbb {R} }$, let ${\displaystyle e_{t}:V\to \mathbb {R} }$ be the evaluation functional, which associates to each ${\displaystyle f\in V}$ the value ${\displaystyle e_{t}(f)=f(t)}$ of the function f at the real point t. Then, for each t, the kernel of ${\displaystyle e_{t}}$ is a one-dimensional linear subspace of V. Hence ${\displaystyle t\mapsto \ker e_{t}}$ defines a function from ${\displaystyle \mathbb {R} \to \mathbb {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.

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

${\displaystyle \int _{\Sigma }K\,dA=2\pi \chi (\Sigma )}$

where ?(?) is the Euler characteristic, which is an integer. 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

${\displaystyle A(S)=\int _{S}1\,dA=2\pi \cdot 2=4\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.

Vector calculus

Vector calculus is a branch of calculus that is concerned with the properties of vector fields, and has many physical applications such as to electricity and magnetism. The Newtonian potential for a point source Q situated at the origin of a three dimensional Cartesian coordinate system is

${\displaystyle V(\mathbf {x} )=-{\frac {kQ}{|\mathbf {x} |}}}$

which represents the potential energy of a unit mass (or charge) placed a distance |x| from the source, and k is a dimensional constant. The field, denoted here by E, which may be the (Newtonian) gravitational field or the (Coulomb) electric field, is the negative gradient of the potential:

${\displaystyle \mathbf {E} =-\nabla V.}$

Special cases include Coulomb's law and Newton's law of universal gravitation. Gauss' law states that the outward flux of the field through any smooth, simple, closed, orientable surface S containing the origin is equal to 4?kQ:

${\displaystyle 4\pi kQ=}$ ${\displaystyle {\scriptstyle S}}$ ${\displaystyle \mathbf {E} \cdot d\mathbf {A} }$

It is standard to absorb this factor of 4? into the constant k, but this argument shows why it must appear somewhere. Furthermore, 4? is the surface area of the unit sphere, but we have not assumed that S is the sphere. However, as a consequence of the divergence theorem, because the region away from the origin is vacuum (source-free) it is only the homology class of the surface S in R³\{0} that matters in computing the integral, so it can be replaced by any convenient surface in the same homology class, in particular a sphere, where spherical coordinates can be used to calculate the integral.

A consequence of the Gauss law is that the negative Laplacian of the potential V is equal to 4?kQ times the Dirac delta function:

${\displaystyle \Delta V(\mathbf {x} )=-4\pi kQ\delta (\mathbf {x} ).}$

More general distributions of matter (or charge) are obtained from this by convolution, giving the Poisson equation

${\displaystyle \Delta V(\mathbf {x} )=-4\pi k\rho (\mathbf {x} )}$

where ? is the distribution function.

The constant ? also plays an analogous role in four-dimensional potentials associated with Einstein's equations, a fundamental formula which forms the basis of the general theory of relativity and describes the fundamental interaction of gravitation as a result of spacetime being curved by matter and energy:

${\displaystyle R_{\mu \nu }-{\frac {1}{2}}Rg_{\mu \nu }+\Lambda g_{\mu \nu }={\frac {8\pi G}{c^{4}}}T_{\mu \nu },}$

where R_?? is the Ricci curvature tensor, R is the scalar curvature, g_?? is the metric tensor, ? is the cosmological constant, G is Newton's gravitational constant, c is the speed of light in vacuum, and T_?? is the stress-energy tensor. The left-hand side of Einstein's equation is a non-linear analog of the Laplacian of the metric tensor, and reduces to that in the weak field limit, with the ${\displaystyle \Lambda g}$ term playing the role of a Lagrange multiplier, and the right hand side is the analog of the distribution function, times 8?.

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 z₀ is interior to ?, then

${\displaystyle \oint _{\gamma }{\frac {dz}{z-z_{0}}}=2\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 z₀, then the above integral is 2?i 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 f(z) on the Jordan curve ? and the value of f(z) at any interior point z₀ of ?:

${\displaystyle \oint _{\gamma }{f(z) \over z-z_{0}}\,dz=2\pi if(z_{0})}$

provided f(z) 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 g(z) is a meromorphic function the region enclosed by ? and is continuous in a neighborhood of ?, then

${\displaystyle \oint _{\gamma }g(z)\,dz=2\pi i\sum \operatorname {Res} (g,a_{k})}$

where the sum is of the residues at the poles of g(z).

The gamma function and Stirling's approximation

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

The gamma function is defined by its Weierstrass product development:

${\displaystyle \Gamma (z)=e^{-\gamma z}\prod _{n=1}^{\infty }{\frac {e^{z/n}}{1+z/n}}}$

where ? is the Euler-Mascheroni constant. Evaluated at z = 1/2 and squared, the equation ?(1/2)² = ? 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 V_n(r) of the n-dimensional ball of radius r in Euclidean n-dimensional space, and the surface area S_n-1(r) of its boundary, the (n-1)-dimensional sphere:

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

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

Further, it follows from the functional equation that

${\displaystyle 2\pi r={\frac {S_{n+1}(r)}{V_{n}(r)}}.}$

The gamma function can be used to create a simple approximation to the factorial function n! for large n: ${\displaystyle n!\sim {\sqrt {2\pi n}}\left({\frac {n}{e}}\right)^{n}}$ which is known as Stirling's approximation. Equivalently,

${\displaystyle \pi =\lim _{n\to \infty }{\frac {e^{2n}n!^{2}}{2n^{2n+1}}}.}$

As a geometrical application of Stirling's approximation, let ?_n denote the standard simplex in n-dimensional Euclidean space, and (n + 1)?_n denote the simplex having all of its sides scaled up by a factor of n + 1. Then

${\displaystyle \operatorname {Vol} ((n+1)\Delta _{n})={\frac {(n+1)^{n}}{n!}}\sim {\frac {e^{n+1}}{\sqrt {2\pi n}}}.}$

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

Number theory and Riemann zeta function

The Riemann zeta function ?(s) is used in many areas of mathematics. When evaluated at s = 2 it can be written as

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

Finding a simple solution for this infinite series was a famous problem in mathematics called the Basel problem. Leonhard Euler solved it in 1735 when he showed it was equal to ?²/6. 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 6/?². This probability is based on the observation that the probability that any number is divisible by a prime p is 1/p (for example, every 7th integer is divisible by 7.) Hence the probability that two numbers are both divisible by this prime is 1/p², and the probability that at least one of them is not is 1 - 1/p². 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:

${\displaystyle {\begin{aligned}\prod _{p}^{\infty }\left(1-{\frac {1}{p^{2}}}\right)&=\left(\prod _{p}^{\infty }{\frac {1}{1-p^{-2}}}\right)^{-1}\\[4pt]&={\frac {1}{1+{\frac {1}{2^{2}}}+{\frac {1}{3^{2}}}+\cdots }}\\[4pt]&={\frac {1}{\zeta (2)}}={\frac {6}{\pi ^{2}}}\approx 61\%.\end{aligned}}}$

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 SL₂(R)/SL₂(Z).

The zeta function also satisfies Riemann's functional equation, which involves ? as well as the gamma function:

${\displaystyle \zeta (s)=2^{s}\pi ^{s-1}\ \sin \left({\frac {\pi s}{2}}\right)\ \Gamma (1-s)\ \zeta (1-s)\!.}$

Furthermore, the derivative of the zeta function satisfies

${\displaystyle \exp(-\zeta '(0))={\sqrt {2\pi }}.}$

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. The calculation can be recast in quantum mechanics, specifically the variational approach to the spectrum of the hydrogen atom.

Fourier series

The constant ? also appears naturally in Fourier series of periodic functions. Periodic functions are functions on the group T =R/Z of fractional parts of real numbers. The Fourier decomposition shows that a complex-valued function f on T can be written as an infinite linear superposition of unitary characters of T. That is, continuous group homomorphisms from T to the circle group U(1) of unit modulus complex numbers. It is a theorem that every character of T is one of the complex exponentials ${\displaystyle e_{n}(x)=e^{2\pi inx}}$.

There is a unique character on T, 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.

Modular forms are holomorphic functions in the upper half plane characterized by their transformation properties under the modular group ${\displaystyle \mathrm {SL} _{2}(\mathbb {Z} )}$ (or its various subgroups), a lattice in the group ${\displaystyle \mathrm {SL} _{2}(\mathbb {R} )}$. An example is the Jacobi theta function

${\displaystyle \theta (z,\tau )=\sum _{n=-\infty }^{\infty }e^{2\pi inz+i\pi n^{2}\tau }}$

which is a kind of modular form called a Jacobi form. This is sometimes written in terms of the nome ${\displaystyle q=e^{\pi i\tau }}$.

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

${\displaystyle \theta (z+\tau ,\tau )=e^{-\pi i\tau -2\pi iz}\theta (z,\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

${\displaystyle g(x)={\frac {1}{\pi }}\cdot {\frac {1}{x^{2}+1}}}$

is a probability density function. The total probability is equal to one, owing to the integral:

${\displaystyle \int _{-\infty }^{\infty }{\frac {1}{x^{2}+1}}\,dx=\pi .}$

The Shannon entropy of the Cauchy distribution is equal to log(4?), 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. 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

${\displaystyle Hf(t)={\frac {1}{\pi }}\int _{-\infty }^{\infty }{\frac {f(x)\,dx}{x-t}}.}$

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. The Hilbert transform, like the Fourier transform, can be characterized purely in terms of its transformation properties on the Hilbert space L²(R): up to a normalization factor, it is the unique bounded linear operator that commutes with positive dilations and anticommutes with all reflections of the real line. The constant ? is the unique normalizing factor that makes this transformation unitary.

Complex dynamics

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

src: www.hdwallpapersfreedownload.com

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 T of a simple pendulum of length L, swinging with a small amplitude (g is the earth's gravitational acceleration):

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

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

${\displaystyle \Delta x\,\Delta p\geq {\frac {h}{4\pi }}.}$

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

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

where m 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 F that a long, slender column of length L, modulus of elasticity E, and area moment of inertia I can carry without buckling:

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

The field of fluid dynamics contains ? in Stokes' law, which approximates the frictional force F exerted on small, spherical objects of radius R, moving with velocity v in a fluid with dynamic viscosity ?:

${\displaystyle F=6\,\pi \,\eta \,R\,v.}$

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

Memorizing digits

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. 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.

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. An early example of a memorization aid, originally devised by English scientist James Jeans, is "How I want a drink, alcoholic of course, after the heavy lectures involving quantum mechanics." When a poem is used, it is sometimes referred to as a piem. Poems for memorizing ? 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.

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, and the full-length book Not a Wake contains 10,000 words, each representing one digit of ?.

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.

In the 2008 Open University and BBC documentary co-production, The Story of Maths, aired in October 2008 on BBC Four, British mathematician Marcus du Sautoy shows a visualization of the - historically first exact - formula for calculating ? when visiting India and exploring its contributions to trigonometry.

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

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

In the United States, Pi Day falls on 14 March (written 3/14 in the US style), and is popular among students. ? and its digital representation are often used by self-described "math geeks" for inside jokes among mathematically and technologically minded groups. Several college cheers at the Massachusetts Institute of Technology include "3.14159". Pi Day in 2015 was particularly significant because the date and time 3/14/15 9:26:53 reflected many more digits of pi.

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

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

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

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.

src: www.dancohen.org

Notes

Footnotes

References

src: i.ytimg.com

Further reading

src: www.sepeb.com

External links

• Digits of Pi at DMOZ
• "Pi" at Wolfram Mathworld
• Representations of Pi at Wolfram Alpha
• Pi Search Engine: 2 billion searchable digits of ?, ?2, and e
• Demonstration by Lambert (1761) of irrationality of ?, online and analyzed BibNum (PDF).

Source of the article : Wikipedia