Proofs of the famous mathematical result that the rational number 22/7 is greater than ? (pi) date back to antiquity. One of these proofs, more recently developed but requiring only elementary techniques from calculus, has attracted attention in modern mathematics due to its mathematical elegance and its connections to the theory of diophantine approximations. Stephen Lucas calls this proof "one of the more beautiful results related to approximating ?". Julian Havil ends a discussion of continued fraction approximations of ? with the result, describing it as "impossible to resist mentioning" in that context.
The purpose of the proof is not primarily to convince its readers that 22/7 (or 3 1/7) is indeed bigger than ?; systematic methods of computing the value of ? exist. If one knows that ? is approximately 3.14159, then it trivially follows that ? < 22/7, which is approximately 3.142857. But it takes much less work to show that ? < 22/7 by the method used in this proof than to show that ? is approximately 3.14159.
Video Proof that 22/7 exceeds ?
Background
22/7 is a widely used Diophantine approximation of ?. It is a convergent in the simple continued fraction expansion of ?. It is greater than ?, as can be readily seen in the decimal expansions of these values:
The approximation has been known since antiquity. Archimedes wrote the first known proof that 22/7 is an overestimate in the 3rd century BCE, although he may not have been the first to use that approximation. His proof proceeds by showing that 22/7 is greater than the ratio of the perimeter of a circumscribed regular polygon with 96 sides to the diameter of the circle. Another rational approximation of ? that is far more accurate is 355/113.
Maps Proof that 22/7 exceeds ?
The proof
The proof can be expressed very succinctly:
Therefore, 22/7 > ?.
The evaluation of this integral was the first problem in the 1968 Putnam Competition. It is easier than most Putnam Competition problems, but the competition often features seemingly obscure problems that turn out to refer to something very familiar. This integral has also been used in the entrance examinations for the Indian Institutes of Technology.
src: i.ytimg.com
Details of evaluation of the integral
That the integral is positive follows from the fact that the integrand is non-negative, being a quotient involving only sums and products of powers of non-negative real numbers. In addition, one can easily check that the integrand is strictly positive for at least one point in the range of integration, say at 1/2. Since the integrand is continuous at that point and non-negative elsewhere, the integral from 0 to 1 must be strictly positive.
It remains to show that the integral in fact evaluates to the desired quantity:
(See polynomial long division.)
src: www.wweek.com
Quick upper and lower bounds
In Dalzell (1944), it is pointed out that if 1 is substituted for x in the denominator, one gets a lower bound on the integral, and if 0 is substituted for x in the denominator, one gets an upper bound:
Thus we have
hence 3.1412 < ? < 3.1421 in decimal expansion. The bounds deviate by less than 0.015% from ?. See also Dalzell (1971).
src: sccpublic.s3-external-1.amazonaws.com
Proof that 355/113 exceeds ?
As discussed in Lucas (2005), the well-known Diophantine approximation and far better upper estimate 355/113 for ? follows from the relation
Note that
where the first six digits after the decimal point agree with those of ?. Substituting 1 for x in the denominator, we get the lower bound
substituting 0 for x in the denominator, we get twice this value as an upper bound, hence
In decimal expansion, this means 3.141 592 57 < ? < 3.141 592 74, where the bold digits of the lower and upper bound are those of ?.
src: media.springernature.com
Extensions
The above ideas can be generalized to get better approximations of ?; see also Backhouse (1995) and Lucas (2005) (in both references, however, no calculations are given). For explicit calculations, consider, for every integer n >= 1,
where the middle integral evaluates to
involving ?. The last sum also appears in Leibniz' formula for ?. The correction term and error bound is given by
where the approximation (the tilde means that the quotient of both sides tends to one for large n) of the central binomial coefficient follows from Stirling's formula and shows the fast convergence of the integrals to ?.
The results for n = 1 are given above. For n = 2 we get
and
hence 3.141 592 31 < ? < 3.141 592 89, where the bold digits of the lower and upper bound are those of ?. Similarly for n = 3,
with correction term and error bound
hence 3.141 592 653 40 < ? < 3.141 592 653 87. The next step for n = 4 is
with
which gives 3.141 592 653 589 55 < ? < 3.141 592 653 589 96.
src: thebridgemarkham.com
See also
- Approximations of ?
- Chronology of computation of ?
- Lindemann-Weierstrass theorem (proof that ? is transcendental)
- List of topics related to ?
- Proof that ? is irrational
src: media.springernature.com
Notes
Citations
src: sccpublic.s3-external-1.amazonaws.com
External links
- The problems of the 1968 Putnam competition, with this proof listed as question A1.
- The Life of Pi by Jonathan Borwein--see page 5 for this integral.
Source of article : Wikipedia