# Babylonian Algorithm for Computing Square Roots

Babylonian Algorithm for Computing Square Roots

The Babylonian algorithm is an ancient method for approximating the square root of a given number through a sequence of rationals. In spite of its longevity, this method is still the most popular, effective and simplest technique for this purpose.

Let be the number whose square root is to be approximated. Start by taking a rectangle of base and height , and an initial guess of such that =r. (Clearly, this can be obtained by setting =r and =1.) Then, calculate the midpoint of and = to get the first estimate of (+). This method attempts to "square" the rectangle by equalizing its side lengths.

r

b

0

h

0

b

0

b

0

h

0

b

0

h

0

b

0

h

0

r

b

0

r

≈1

2

b

0

h

0

Repeating this process for some , we obtain the recursive formula:

n≥1

b

n

1

2

b

n-1

r

b

n-1

The sequence is bounded and monotone, and therefore convergent. The Babylonian method is actually a particular case of the Newton–Raphson iteration, and consequently, it converges quadratically; that is, the number of accurate digits in the approximation nearly doubles after each iteration. More specifically, we have:

{}

b

n

n∈

lim

n∞

b

n

r

This Demonstration gives numerical estimations to the square roots of 2, 3, 5, 7, 11 up to 50 decimals using the Babylonian algorithm and illustrates the convergence process by plotting connected red dots for the sequential approximations. The actual value of the square root is represented in the plot by a solid black line.