A Python pacakge to calculate sqrt(n)
with very high precision. "sqrtn"" implements dramatically fast. It takes only less than 30 seconds to approximate square root of 2 with 100,000
digits. Function sqrtn2()
can approximate square root of n
for any positive integer. The last two or three digits may be incorrect. For seek of safety, it is better to input two or three more to guarantee precision.
pip install git+https://github.com/xliusufe/sqrtnpy.git
-
Syntax:
sqrtn(n,prec)
-
Input:
n
: a natural numberprec
: The a positive integer, which is the precision you want.
-
Output: the square root of
n
, which is a string.
-
-
The corresponding R package named sqrtn can be found on github.
from sqrtn import sqrtn
fit = sqrtn(2, 100)
print(fit)
import sqrtn
fit = sqrtn.sqrtn(2, 100)
print(fit)
This Python package is developed by Xu Liu (liu.xu@sufe.edu.cn).
-
Web-based calculator --------A web-based calculator
-
sqrt2.md ---------- The first one hundred thousand digits of the square root of 2.
-
sqrt3.md ---------- The first many digits of the square root of 3.
-
sqrt5.md ---------- The first many digits of the square root of 5.
-
sqrt6.md ---------- The first many digits of the square root of 6.
-
sqrt7.md ---------- The first many digits of the square root of 7.
-
sqrt8.md ---------- The first many digits of the square root of 8.