Changes for version 0.40 - 2016-08-01
- ADDED
- sqrtint(n) Integer square root of n
- rootint(n,k) Integer k-th root of n
- is_prime_power(n) Returns k if n=p^k for p a prime.
- OTHER
- is_perrin_pseudoprime 2x faster. Takes optional second argument for additional restrictions.
Modules
Utilities related to prime numbers and factoring, using GMP