Content deleted Content added
Link suggestions feature: 3 links added. Tags: Visual edit Mobile edit Mobile web edit Advanced mobile edit Newcomer task Suggested: add links |
|||
(44 intermediate revisions by 34 users not shown) | |||
Line 1:
{{Short description|Calculation of π by 3rd century mathematician Liu Hui}}
{{DISPLAYTITLE:Liu Hui's {{pi}} algorithm}}
{{pi box}}
[[Image:Cutcircle2.svg|thumb|right|Liu Hui's method of calculating the area of a circle]]
'''Liu Hui's {{pi}} algorithm''' was invented by [[Liu Hui]] (fl. 3rd century), a mathematician of the state of [[
Liu Hui remarked in his commentary to
==Area of a circle==
Line 13 ⟶ 14:
:"''Multiply one side of a hexagon by the radius (of its circumcircle), then multiply this by three, to yield the area of a dodecagon; if we cut a hexagon into a dodecagon, multiply its side by its radius, then again multiply by six, we get the area of a 24-gon; the finer we cut, the smaller the loss with respect to the area of circle, thus with further cut after cut, the area of the resulting polygon will coincide and become one with the circle; there will be no loss''".
This is essentially equivalent to:
: <math>\lim_{N \to \infty}\text{area of }N\text{-gon} = \text{area of circle}. \, </math>
Line 22 ⟶ 23:
In the diagram {{math|''d''}} = excess radius. Multiplying {{math|''d''}} by one side results in oblong {{math|ABCD}} which exceeds the boundary of the circle. If a side of the polygon is small (i.e. there is a very large number of sides), then the excess radius will be small, hence excess area will be small.
As in the diagram, when {{math|''N'' → ∞}}, {{math|''d'' →
"''Multiply the
When {{math|''N'' → ∞}}, half the circumference of the {{math|''N''}}-gon approaches a semicircle, thus half a circumference of a circle multiplied by its radius equals the area of the circle. Liu Hui did not explain in detail this deduction. However, it is self-evident by using Liu Hui's "in-out complement principle" which he provided elsewhere in ''The Nine Chapters on the Mathematical Art'': Cut up a geometric shape into parts, rearrange the parts to form another shape, the area of the two shapes will be identical.
Thus rearranging the six green triangles, three blue triangles and three red triangles into a rectangle with width = 3{{math|''L''}}, and height {{math|''R''}} shows that the area of the dodecagon = 3{{math|''RL''}}.
Line 45 ⟶ 46:
:Yellow area + green area + red area = <math>A_{2N} + D_{2N}.</math>
Let
:<math>A_{2N} < A_{C} < A_{2N} + D_{2N}.</math>
If the radius of the circle is taken to be 1, then we have Liu Hui's {{pi}} inequality:
Line 59 ⟶ 60:
Liu Hui began with an inscribed hexagon. Let {{math|M}} be the length of one side {{math|AB}} of hexagon, {{math|''r''}} is the radius of circle.
Bisect {{math|AB}} with line {{math|OPC}}, {{math|AC}} becomes one side of [[dodecagon]] (12-gon), let its length be {{math|m}}. Let the length of {{math|PC}} be {{math|j}} and the length of {{math|OP}} be {{math|G}}.
{{math|
: <math>{} G^2 = r^2 - \left(\tfrac{M}{2}\right)^2</math>
: <math>{} G = \sqrt{r^2- \tfrac{M^2}{4}}</math>
: <math>{} j = r - G = r - \sqrt{r^2- \tfrac{M^2}{4}}</math>
: <math>{} m^2 = \left(\tfrac{M}{2}\right)^2 + j^2</math>
: <math>{} m = \sqrt{
: <math>{} m = \sqrt{\left(\tfrac{M}{2}\right)^2 + \left(r - G\right)^2}</math>
: <math>{} m = \sqrt{\left(\tfrac{M}{2}\right)^2 + \left(r - \sqrt{r^2- \tfrac{M^2}{4}}\right)^2}</math>
From here, there is now a technique to determine {{math|m}} from {{math|M}}, which gives the side length for a polygon with twice the number of edges. Starting with a [[hexagon]], Liu Hui could determine the side length of a dodecagon using this formula. Then continue repetitively to determine the side length of an [[icositetragon]] given the side length of a dodecagon. He could do this recursively as many times as necessary. Knowing how to determine the area of these polygons, Liu Hui could then approximate {{pi}}.
: area of 96-gon <math>{}A_{192} = 314 {64 \over 625} </math> ▼
: area of [[tetracontaoctagon|96-gon]] <math>{}A_{96} = 313 {584 \over 625} </math>
: Difference of 96-gon and 48-gon:
Line 79 ⟶ 84:
:from Liu Hui's {{pi}} inequality:
:<math> A_{2N} < A_{C} < A_{2N} + D_{2N}.</math>
:Since {{math|''r''}} = 10, <math>A_{
:therefore:
:<math>{}314\frac{64}{625}<100 \times \pi <314 \frac{64}{625} +\frac{105}{625}</math>
Line 87 ⟶ 92:
:<math>{} 3.141024 < \pi < 3.142704.</math>
He never took {{pi}} as the average of the lower limit 3.141024 and upper limit 3.142704. Instead he suggested that 3.14 was a good enough approximation for {{pi}}, and expressed it as a fraction <math>\tfrac{157}{50}</math>; he pointed out this number is slightly less than the
Liu Hui carried out his calculation with [[rod calculus]], and expressed his results with fractions. However, the iterative nature of Liu Hui's {{pi}} algorithm is quite clear:
Line 97 ⟶ 102:
== Quick method ==
Calculation of square roots of irrational numbers was not an easy task in the third century with
[[counting rods]]. Liu Hui discovered a
Let {{math|D}}<sub>{{math|N}}</sub> denote the difference in areas of {{math|N}}-gon and ({{math|N}}/2)-gon
Line 135 ⟶ 140:
Liu Hui was quite happy with this result because he had acquired the same result with the calculation for a 1536-gon, obtaining the area of a 3072-gon. This explains four questions:
# Why he stopped short at {{math|''A''}}<sub>192</sub> in his presentation of his algorithm. Because he discovered a quick method of improving the accuracy of {{pi}}, achieving same result of 1536-gon with only 96-gon. After all calculation of square roots was not a simple task with [[rod calculus]]. With the quick method, he only needed to perform one more [[subtraction]], one more division (by 3) and one more addition, instead of four more square root extractions.
# Why he preferred to calculate {{pi}} through calculation of areas instead of circumferences of successive polygons, because the quick method required information about the difference in '''areas''' of successive polygons.
# Who was the true author of the paragraph containing calculation of <math>\pi = {3927 \over 1250}.</math>
# That famous paragraph began with "A [[Han dynasty]] bronze container in the military warehouse of [[Jin Dynasty (265–420)|Jin dynasty]]....". Many scholars, among them [[Yoshio Mikami]] and [[Joseph Needham]], believed that the "Han dynasty bronze container" paragraph was the work of Liu Hui and not Zu Chongzhi as other believed, because of the strong correlation of the two methods through area calculation, and because there was not a single word mentioning Zu's 3.1415926 < {{pi}} < 3.1415927 result obtained through 12288-gon.
==Later developments==
Line 164 ⟶ 169:
==Significance of Liu Hui's algorithm==
Liu Hui's {{pi}} algorithm was one of his most important contributions to ancient [[Chinese mathematics]]. It was based on calculation of {{math|N}}-gon area, in contrast to the Archimedean algorithm based on polygon circumference.
== See also ==
* [[Method of exhaustion]] (5th century BC)
* [[Zhao Youqin's π algorithm]] (13-14th century)
* [https://proofwiki.org/wiki/Newton%27s_Formula_for_Pi Proof of Newton's Formula for Pi] (17th century)
==Notes==
:{{note|1|1}} Correct value: 0.2502009052
:{{note|2|2}} Correct values:
Line 189 ⟶ 194:
== Further reading ==
*Needham, Joseph (1986). ''Science and Civilization in China'': Volume 3, Mathematics and the Sciences of the Heavens and the Earth. Taipei: Caves Books, Ltd.
* Wu Wenjun ed, ''History of Chinese Mathematics'' Vol III (in Chinese)
{{DEFAULTSORT:Liu Hui's Pi Algorithm}}
[[Category:Pi algorithms]]
[[Category:Chinese
[[Category:Cao Wei]]
|