Computing N-th Roots using the Babylonian Method

René Thiemann 🌐

January 3, 2013

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

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.

License

GNU Lesser General Public License (LGPL)

History

July 11, 2014
Moved NthRoot_Impl from Real-Impl to this entry.
October 16, 2013
Added algorithms to compute floor and ceiling of sqrt of integers.

Topics

Session Sqrt_Babylonian

Depends on

Used by

Cite

× 
@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},
}
Download

Download

× Download latest

Older releases: