# Area of a disk

Template:Pi box
The **area of a disk**, more commonly called the **area of a circle**, of radius *r* is equal to π*r*^{2}. Here the symbol π (Greek letter pi) denotes the constant ratio of the circumference of a circle to its diameter or of the area of a circle to the square of its radius. Since the area of a regular polygon is half its perimeter times its apothem, and a regular polygon becomes a circle as the number of sides increase, the area of a disk is half its circumference times its radius (i.e. Template:Frac × 2π*r* × *r*).

## History

Modern mathematics can obtain the area using the methods of integral calculus or its more sophisticated offspring, real analysis. However the area of circles was studied by the Ancient Greeks. Eudoxus of Cnidus in the fifth century B.C. had found that the areas of circles are proportional to their radius squared.^{[1]} The great mathematician Archimedes used the tools of Euclidean geometry to show that the area inside a circle is equal to that of a right triangle whose base has the length of the circle's circumference and whose height equals the circle's radius in his book *Measurement of a Circle*. The circumference is 2π*r*, and the area of a triangle is half the base times the height, yielding the area π*r*^{2} for the disk. Prior to Archimedes, Hippocrates of Chios was the first to show that the area of a disk is proportional to the square of its diameter, as part of his quadrature of the lune of Hippocrates,^{[2]} but did not identify the constant of proportionality.

## Using polygons

The area of a regular polygon is half its perimeter times the apothem. As the number of sides of the regular polygon increases, the polygon tends to a circle, and the apothem tends to the radius. This suggests that the area of a circle is half its circumference times the radius.^{[3]}

## Archimedes's proof

Following Template:Harvtxt, compare a circle to a right triangle whose base has the length of the circle's circumference and whose height equals the circle's radius. If the area of the circle is not equal to that of the triangle, then it must be either greater or less. We eliminate each of these by contradiction, leaving equality as the only possibility. We use regular polygons in the same way.

### Not greater

Suppose the circle area, *C*, may be greater than the triangle area, *T* = ^{1}⁄_{2}*cr*. Let *E* denote the excess amount. Inscribe a square in the circle, so that its four corners lie on the circle. Between the square and the circle are four segments. If the total area of those gaps, *G*_{4}, is greater than *E*, split each arc in half. This makes the inscribed square into an inscribed octagon, and produces eight segments with a smaller total gap, *G*_{8}. Continue splitting until the total gap area, *G _{n}*, is less than

*E*. Now the area of the inscribed polygon,

*P*=

_{n}*C*−

*G*, must be greater than that of the triangle.

_{n}But this forces a contradiction, as follows. Draw a perpendicular from the center to the midpoint of a side of the polygon; its length, *h*, is less than the circle radius. Also, let each side of the polygon have length *s*; then the sum of the sides, *ns*, is less than the circle circumference. The polygon area consists of *n* equal triangles with height *h* and base *s*, thus equals ^{1}⁄_{2}*nhs*. But since *h* < *r* and *ns* < *c*, the polygon area must be less than the triangle area, ^{1}⁄_{2}*cr*, a contradiction. Therefore our supposition that *C* might be greater than *T* must be wrong.

### Not less

Suppose the circle area may be less than the triangle area. Let *D* denote the deficit amount. Circumscribe a square, so that the midpoint of each edge lies on the circle. If the total area gap between the square and the circle, *G*_{4}, is greater than *D*, slice off the corners with circle tangents to make a circumscribed octagon, and continue slicing until the gap area is less than *D*. The area of the polygon, *P _{n}*, must be less than

*T*.

This, too, forces a contradiction. For, a perpendicular to the midpoint of each polygon side is a radius, of length *r*. And since the total side length is greater than the circumference, the polygon consists of *n* identical triangles with total area greater than *T*. Again we have a contradiction, so our supposition that *C* might be less than *T* must be wrong as well.

Therefore it must be the case that the area of the circle is precisely the same as the area of the triangle. This concludes the proof.

## Rearrangement proof

Following Satō Moshun Template:Harv and Leonardo da Vinci Template:Harv, we can use inscribed regular polygons in a different way. Suppose we inscribe a hexagon. Cut the hexagon into six triangles by splitting it from the center. Two opposite triangles both touch two common diameters; slide them along one so the radial edges are adjacent. They now form a parallelogram, with the hexagon sides making two opposite edges, one of which is the base, *s*. Two radial edges form slanted sides, and the height is *h* (as in the Archimedes proof). In fact, we can assemble all the triangles into one big parallelogram by putting successive pairs next to each other. The same is true if we increase to eight sides and so on. For a polygon with 2*n* sides, the parallelogram will have a base of length *ns*, and a height *h*. As the number of sides increases, the length of the parallelogram base approaches half the circle circumference, and its height approaches the circle radius. In the limit, the parallelogram becomes a rectangle with width π*r* and height *r*.

**Unit disk area by rearranging n polygons.**polygon parallelogram *n*side base height area 4 1.4142136 2.8284271 0.7071068 2.0000000 6 1.0000000 3.0000000 0.8660254 2.5980762 8 0.7653669 3.0614675 0.9238795 2.8284271 10 0.6180340 3.0901699 0.9510565 2.9389263 12 0.5176381 3.1058285 0.9659258 3.0000000 14 0.4450419 3.1152931 0.9749279 3.0371862 16 0.3901806 3.1214452 0.9807853 3.0614675 96 0.0654382 3.1410320 0.9994646 3.1393502 ∞ 1/∞ π 1 π

## Onion proof

Using calculus, we can sum the area incrementally, partitioning the disk into thin concentric rings like the layers of an onion. This is the method of shell integration in two dimensions. For an infinitesimally thin ring of the "onion" of radius *t*, the accumulated area is 2π*t dt*, the circumferential length of the ring times its infinitesimal width (you can approach this ring by a rectangle with width=2π*t* and height=*dt*). This gives an elementary integral for a disk of radius *r*.

## Triangle proof

Similar to the onion proof outlined above, we could exploit calculus in a different way in order to arrive at the formula for the area of a circle. In this case, we imagine dividing up a circle into triangles, each with a base of length equal to the circle's radius and a height that is infinitesimally small. The area of each of these triangles is equal to 1/2 * r * dt. By summing up (integrating) all of the areas of these triangles, we arrive at the formula for the circle's area:

## Fast approximation

The calculations Archimedes used to approximate the area numerically were laborious, and he stopped with a polygon of 96 sides. A faster method uses ideas of Willebrord Snell (*Cyclometricus*, 1621), further developed by Christiaan Huygens (*De Circuli Magnitudine Inventa*, 1654), described in Template:Harvtxt.

### Archimedes' doubling method

Given a circle, let *u _{n}* be the perimeter of an inscribed regular

*n-*gon, and let

*U*be the perimeter of a circumscribed regular

_{n}*n-*gon. Then

*u*and

_{n}*U*are lower and upper bounds for the circumference of the circle that become sharper and sharper as

_{n}*n*increases, and their average (

*u*+

_{n}*U*)/2 is an especially good approximation to the circumference. To compute

_{n}*u*and

_{n}*U*for large

_{n}*n*, Archimedes derived the following doubling formulae:

Starting from a hexagon, Archimedes doubled *n* four times to get a 96-gon, which gave him a good approximation to the circumference of the circle.

In modern notation, we can reproduce his computation (and go farther) as follows.
For a unit circle, an inscribed hexagon has *u*_{6} = 6, and a circumscribed hexagon has *U*_{6} = 4√3.
Doubling seven times yields

**Archimedes doubling seven times; n = 6×2**^{k}.*k**n**u*_{n}*U*_{n}( *u*+_{n}*U*)/4_{n}0 6 6.0000000 6.9282032 3.2320508 1 12 6.2116571 6.4307806 3.1606094 2 24 6.2652572 6.3193199 3.1461443 3 48 6.2787004 6.2921724 3.1427182 4 96 6.2820639 6.2854292 3.1418733 5 192 6.2829049 6.2837461 3.1416628 6 384 6.2831152 6.2833255 3.1416102 7 768 6.2831678 6.2832204 3.1415970

(Here (*u _{n}* +

*U*)/2 approximates the circumference of the unit circle, which is 2π, so (

_{n}*u*+

_{n}*U*)/4 approximates π.)

_{n}The last entry of the table has ^{355}⁄_{113} as one of its best rational approximations;
i.e., there is no better approximation among rational numbers with denominator up to 113.
The number ^{355}⁄_{113} is also an excellent approximation to π, better than any other rational number with denominator less than 16604.^{[4]}

### The Snell–Huygens refinement

Snell proposed (and Huygens proved) a tighter bound than Archimedes':

This for *n* = 48 gives a better approximation (about 3.14159292) than Archimedes' method for *n* = 768.

### Derivation of Archimedes' doubling formulae

Let one side of an inscribed regular *n-*gon have length *s _{n}* and touch the circle at points A and B. Let A′ be the point opposite A on the circle, so that A′A is a diameter, and A′AB is an inscribed triangle on a diameter. By Thales' theorem, this is a right triangle with right angle at B. Let the length of A′B be

*c*, which we call the complement of

_{n}*s*; thus

_{n}*c*

_{n}^{2}+

*s*

_{n}^{2}= (2

*r*)

^{2}. Let C bisect the arc from A to B, and let C′ be the point opposite C on the circle. Thus the length of CA is

*s*

_{2n}, the length of C′A is

*c*

_{2n}, and C′CA is itself a right triangle on diameter C′C. Because C bisects the arc from A to B, C′C perpendicularly bisects the chord from A to B, say at P. Triangle C′AP is thus a right triangle, and is similar to C′CA since they share the angle at C′. Thus all three corresponding sides are in the same proportion; in particular, we have C′A : C′C = C′P : C′A and AP : C′A = CA : C′C. The center of the circle, O, bisects A′A, so we also have triangle OAP similar to A′AB, with OP half the length of A′B. In terms of side lengths, this gives us

In the first equation C′P is C′O+OP, length *r*+^{1}⁄_{2}*c _{n}*, and C′C is the diameter, 2

*r*. For a unit circle we have the famous doubling equation of Ludolph van Ceulen,

If we now circumscribe a regular *n-*gon, with side A″B″ parallel to AB, then OAB and OA″B″ are similar triangles, with A″B″ : AB = OC : OP. Call the circumscribed side *S _{n}*; then this is

*S*:

_{n}*s*= 1 :

_{n}^{1}⁄

_{2}

*c*. (We have again used that OP is half the length of A′B.) Thus we obtain

_{n}Call the inscribed perimeter *u _{n}* =

*ns*, and the circumscribed perimenter

_{n}*U*=

_{n}*nS*. Then combining equations, we have

_{n}so that

This gives a geometric mean equation.

We can also deduce

or

This gives a harmonic mean equation.

## Dart approximation

When more efficient methods of finding areas are not available, we can resort to “throwing darts”. This Monte Carlo method uses the fact that if random samples are taken uniformly scattered across the surface of a square in which a disk resides, the proportion of samples that hit the disk approximates the ratio of the area of the disk to the area of the square. This should be considered a method of last resort for computing the area of a disk (or any shape), as it requires an enormous number of samples to get useful accuracy; an estimate good to 10^{−n} requires about 100^{n} random samples Template:Harv.

## Finite rearrangement

We have seen that by partitioning the disk into an infinite number of pieces we can reassemble the pieces into a rectangle. A remarkable fact discovered relatively recently Template:Harv is that we can dissect the disk into a large but *finite* number of pieces and then reassemble the pieces into a square of equal area. This is called Tarski's circle-squaring problem. The nature of Laczkovich's proof is such that it proves the existence of such a partition (in fact, of many such partitions) but does not exhibit any particular partition.

## Generalizations

We can stretch a disk to form an ellipse. Because this stretch is a linear transformation of the plane, it has a distortion factor which will change the area but preserve *ratios* of areas. This observation can be used to compute the area of an arbitrary ellipse from the area of a unit circle.

Consider the unit circle circumscribed by a square of side length 2. The transformation sends the circle to an ellipse by stretching or shrinking the horizontal and vertical diameters to the major and minor axes of the ellipse. The square gets sent to a rectangle circumscribing the ellipse. The ratio of the area of the circle to the square is π/4, which means the ratio of the ellipse to the rectangle is also π/4. Suppose *a* and *b* are the lengths of the major and minor axes of the ellipse. Since the area of the rectangle is *ab*, the area of the ellipse is π*ab*/4.

We can also consider analogous measurements in higher dimensions. For example, we may wish to find the volume inside a sphere. When we have a formula for the surface area, we can use the same kind of “onion” approach we used for the disk.

## Triangle method

This approach is a slight modification of onion proof. Consider unwrapping the concentric circles to straight strips. This will form a right angled triangle with r as its height and 2πr (being the outer slice of onion) as its base.

Finding the area of this triangle will give the area of circle

The opposite and adjacent angles for this triangle are respectively in degrees 9.0430611..., 80.956939... and in radians 0.1578311... A233527, 1.4129651... A233528.

## Bibliography

- {{#invoke:citation/CS1|citation

|CitationClass=citation
}}

(Originally published by Cambridge University Press, 1897, based on J. L. Heiberg's Greek version.)

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation
}}

(Originally *Grundzüge der Mathematik*, Vandenhoeck & Ruprecht, Göttingen, 1971.)

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

## References

- ↑ {{#invoke:citation/CS1|citation |CitationClass=book }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ Hill, George.
*Lessons in Geometry: For the Use of Beginners*, page 124 (1894). - ↑ Not all best rational approximations are the convergents of the continued fraction!

## External links

- Area of a Circle Calculator
- Area enclosed by a circle (with interactive animation)
- Science News on Tarski problem