Madhava's Correction Term

Madhava's correction term is a mathematical expression attributed to Madhava of Sangamagrama (c. 1340 – c. 1425), the founder of the Kerala school of astronomy and mathematics, that can be used to give a better approximation to the value of the mathematical constant (''pi'') than the partial sum approximation obtained by truncating the Madhava–Leibniz infinite series for . The Madhava–Leibniz infinite series for is

:$\frac=1-\frac+\frac-\frac+ \cdots$

Taking the partial sum of the first $n$ terms we have the following approximation to :

:$\frac \approx 1-\frac+\frac-\frac+ \cdots + (-1)^\frac$

Denoting the Madhava correction term by $F(n)$, we have the following better approximation to :

:$\frac \approx 1-\frac+\frac-\frac+ \cdots + (-1)^\frac + (-1)^n F(n)$

Three different expressions have been attributed to Madhava as possible values of $F(n)$, namely,

:$F_1(n)=\frac$
:$F_2(n)=\frac$
:$F_3(n)=\frac$

In the extant writings of the mathematicians of the Kerala school there are some indications regarding how the correction terms $F_1(n)$ and $F_2(n)$ have been obtained, but there are no indications on how the expression $F_3(n)$ has been obtained. This has led to a lot of speculative work on how the formulas might have been derived.

Correction terms as given in Kerala texts

The expressions for $F_2(n)$ and $F_3(n)$ are given explicitly in the '' Yuktibhasha'', a major treatise on mathematics and astronomy authored by the Indian astronomer Jyesthadeva of the Kerala school of mathematics around 1530, but that for $F_1(n)$ appears there only as a step in the argument leading to the derivation of $F_2(n)$.

The ''Yuktidipika–Laghuvivrthi'' commentary of ''Tantrasangraha'', a treatise written by Nilakantha Somayaji an astronomer/mathematician belonging to the Kerala school of astronomy and mathematics and completed in 1501, presents the second correction term in the following verses (Chapter 2: Verses 271–274):

:

English translation of the verses:

:"To the diameter multiplied by 4 alternately add and subtract in order the diameter multiplied by 4 and divided separately by the odd numbers 3, 5, etc. That odd number at which this process ends, four times the diameter should be multiplied by the next even number, halved and hendivided by one added to that vennumber squared. The result is to be added or subtracted according as the last term was subtracted or added. This gives the circumference more accurately than would be obtained by going on with that process."

In modern notations this can be stated as follows (where $d$ is the diameter of the circle):

: Circumference $= 4d - \frac + \frac- \cdots \pm \frac \mp \frac$

If we set $p=2n-1$, the last term in the right hand side of the above equation reduces to $4d F_2(n)$.

The same commentary also gives the correction term $F_3(n)$ in the following verses (Chapter 2: Verses 295–296):

:

English translation of the verses:

:"A subtler method, with another correction. etainthe first procedure involving division of four times the diameter by the odd numbers, 3, 5, etc. utthen add or subtract it our times the diametermultiplied by one added to the next even number halved and squared, and divided by one added to four times the preceding multiplier ith thismultiplied by the even number halved."

In modern notations, this can be stated as follows:

:$\text = 4d - \frac3 + \frac5 - \cdots \pm \fracp \mp \frac,$

where the "multiplier" $m = 1 + \left((p+1)/2\right)^2.$ If we set $p=2n-1$, the last term in the right hand side of the above equation reduces to $4d F_3(n)$.

Accuracy of the correction terms

Let

: $s_i = 1-\frac+\frac-\frac+ \cdots + (-1)^\frac + (-1)^n F_i(n)$.

Then, writing $p=2n+1$, the errors $\left, \frac-s_i(n)\$ have the following bounds:

:\begin&\begin
\frac - \frac &< \left, \frac-s_1(n)\ < \frac, \\ 0mu\frac - \frac &< \left, \frac-s_2(n)\ < \frac,
\end\\ 0mu&\begin
&\frac - \frac \cdots \\ 0mu&\phantom
< \left, \frac-s_3(n)\ < \frac.
\end\end

Numerical values of the errors in the computation of

The errors in using these approximations in computing the value of are

:$E(n) = \pi - 4\left( 1-\frac+\frac-\frac+ \cdots + (-1)^\frac \right)$
:$E_i(n) = E(n) - 4\times (-1)^n F_i(n)$

The following table gives the values of these errors for a few selected values of $n$.

Continued fraction expressions for the correction terms

It has been noted that the correction terms $F_1(n), F_2(n), F_3(n)$ are the first three convergents of the following continued fraction expressions:

*$\cfrac$

*$\cfrac= \cfrac$

The function $f(n)$ that renders the equation
:$\frac = 1 - \frac+\frac - \cdots \pm \frac \mp f(n+1)$

exact can be expressed in the following form:

:$f(n) = \frac\times \cfrac$

The first three convergents of this infinite continued fraction are precisely the correction terms of Madhava. Also, this function $f(n)$ has the following property:

:$f(2n) = \cfrac$

Speculative derivation by Hayashi ''et al.''

In a paper published in 1990, a group of three Japanese researchers proposed an ingenious method by which Madhava might have obtained the three correction terms. Their proposal was based on two assumptions: Madhava used $355/113$ as the value of and he used the Euclidean algorithm for division.

Writing

:$S(n) = \left, 1 - \frac +\frac-\frac+ \cdots +\frac - \frac\$

and taking $\pi=355/113,$ compute the values $S(n),$ express them as a fraction with 1 as numerator, and finally ignore the fractional parts in the denominator to obtain approximations:

:\begin
S(1) &= \ \ \,\frac &&= \ \ \ \frac &&\approx \frac, \\ muS(2) &= \ \ \frac &&= \ \ \,\frac &&\approx \frac, \\ muS(3) &= \ \ \frac &&= \ \,\frac &&\approx \frac, \\ muS(4) &= \ \frac &&= \ \frac &&\approx \frac, \\ muS(5) &= \frac &&= \frac &&\approx \frac.
\end

This suggests the following first approximation to $S(n)$ which is the correction term $F_1(n)$ talked about earlier.

:$S(n) \approx \frac$

The fractions that were ignored can then be expressed with 1 as numerator, with the fractional parts in the denominators ignored to obtain the next approximation. Two such steps are:

:\begin
\frac &= \ \,\frac &&\approx \frac,
& \frac &= \,\frac &&\approx \frac, \\ mu \frac &= \ \,\frac &&\approx \frac,
& \frac &= \,\frac &&\approx \frac, \\ mu \frac &= \ \frac &&\approx \frac,
& \frac &= \,\frac &&\approx \frac, \\ mu\frac &= \frac &&\approx \frac,
& \frac &= \frac &&\approx \frac, \\ mu \frac &= \frac &&\approx \frac,
&\quad \frac &= \frac &&\approx \frac.
\end

This yields the next two approximations to $S(n),$ exactly the same as the correction terms $F_2(n),$

:$S(n)\approx \frac = \frac,$

and $F_3(n),$

:$S(n) \approx \dfrac = \frac,$

attributed to Madhava.

See also

*Madhava series
*Madhava's sine table

References

Additional reading

*
*
*

{{Indian mathematics

Pi
History of calculus
Kerala school of astronomy and mathematics
Series (mathematics)