Module Funarith_zarith__.Int_zarith

include Funarith.Int.FULL with type t = Z.t
include Funarith.Int_intf.DERIVED
include Funarith.Int_intf.BASE
type t
val (+) : t ‑> t ‑> t
val (-) : t ‑> t ‑> t
val (*) : t ‑> t ‑> t
val compare : t ‑> t ‑> int
val of_int : int ‑> t
val pp : t CCFormat.printer
val pred : t ‑> t
val succ : t ‑> t
val zero : t
val sign : t ‑> int
val equal : t ‑> t ‑> bool
val one : t
val minus_one : t
val hash : t ‑> int
val divexact : t ‑> t ‑> t
val rem : t ‑> t ‑> t
val sqrt : t ‑> t
val probab_prime : t ‑> int ‑> int

probab_prime n strength is a sound, fast, but incomplete primality checker. It must return:

  • 0 if n is not a prime
  • 1 if n might be a prime
  • 2 if n is a prime

If the answer is 0 or 1 then it must be valid.