**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

### 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.