Module `NumCompat.Z`

val zero : t
val one : t
val two : t
val add : t -> t -> t
val sub : t -> t -> t
val mul : t -> t -> t
val div : t -> t -> t
val neg : t -> t
val sign : t -> int
val equal : t -> t -> bool
val compare : t -> t -> int
val power_int : t -> int -> t
val quomod : t -> t -> t * t
val ppcm : t -> t -> t
val gcd : t -> t -> t: gcd x y Greatest Common Divisor. Must always return a positive number

val lcm : t -> t -> t: lcm x y Least Common Multiplier. Must always return a positive number