Computing Square Roots using the Babylonian Method

René Thiemann

The Archive of Formal Proofs, 2013. 



We implement the Babylonian method to compute n-th roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for square roots over linear ordered fields. Moreover, there are precise algorithms to compute the floor and the ceiling of n-th roots.


   AFP entry


author = {René Thiemann},
title = {Computing Square Roots using the Babylonian Method},
journal = "Archive of Formal Proofs",
month = jan,
year = 2013,
note = {\url{}, Formal proof development},
ISSN = {2150-914x},
Nach oben scrollen