Category Documents
trunc
ある数を 0 に向かって最も近い整数へと切り捨てる
ilog10
compute integer base b logarithm
isqrt
integer square root
modp1
univariate polynomial arithmetic modulo n
issqr
test if an integer is a perfect square
chrem
Chinese Remainder Algorithm
modp2
bivariate polynomial arithmetic modulo n
igcdex
extended Euclidean algorithm for integers
isqrfree
integer square-free factorization
numtheory/factorEQ
integer factorization in Z(sqrt(d)) where Z(sqrt(d)) is a Euclidean ring
surd
non-principal root function
iperfpow
determine if an integer is a perfect power