Abstract

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.

BibTeX

@article{Sqrt_Babylonian-AFP,
  author  = {René Thiemann},
  title   = {Computing N-th Roots using the Babylonian Method},
  journal = {Archive of Formal Proofs},
  month   = {January},
  year    = {2013},
  note    = {\url{https://isa-afp.org/entries/Sqrt_Babylonian.html},
            Formal proof development},
  ISSN    = {2150-914x},
}