num-prime 0.0.4

`num-prime` is based on `num` and extends it with prime related utilities. It support integer modular arithmetics and various number theoretic functions with arbitrary precision.
docs.rs failed to build num-prime-0.0.4
Please check the build logs for more information.
See Builds for ideas on how to fix a failed build, or Metadata for how to configure docs.rs builds.
If you believe this is docs.rs' fault, open an issue.
Visit the last successful build: num-prime-0.4.4

num-prime

This crate provides utilities for integer modular arithmetics and prime related functionalities:

  • Modular Arithmetics
    • Modular operators: add, sub, mul, pow, neg, inv
    • Jacobi Symbol
  • Related Number theoretic functions
  • Primality check
    • Fermat probable prime test
    • Miller-rabin probable prime test
    • (strong/extra strong) Lucas probable prime test
    • Baillie-PSW test
  • Primes generation and indexing
  • Integer factorization
    • Trial division
    • Pollard's rho

It's based on the num creates.