module Mpz:GMP multi-precision integerssig..end
type 'a tt 
type 
type 
typet =m tt
set, add, ...) the first parameter of type t is an out-parameter and holds the result when the function returns. For instance, add x y z adds the values of y and z and stores the result in x.
 These functions are as efficient as their C counterpart: they do not imply additional memory allocation, unlike the corresponding functions in the module Mpzf.
Pretty printing
val print : Format.formatter -> 'a tt -> unitval init : unit -> 'a ttval init2 : int -> 'a ttval realloc2 : t -> int -> unitval set : t -> 'a tt -> unitval set_si : t -> int -> unitval set_d : t -> float -> unitset_q: t -> Mpq.t -> unit, see Mpq.get_zval _set_str : t -> string -> int -> unitval set_str : t -> string -> base:int -> unitval swap : t -> t -> unitval init_set : 'a tt -> 'b ttval init_set_si : int -> 'a ttval init_set_d : float -> 'a ttval _init_set_str : string -> int -> 'a ttval init_set_str : string -> base:int -> tval get_si : 'a tt -> nativeintval get_int : 'a tt -> intval get_d : 'a tt -> floatval get_d_2exp : 'a tt -> float * intval _get_str : int -> 'a tt -> stringval get_str : base:int -> 'a tt -> stringval to_string : 'a tt -> stringval to_float : 'a tt -> floatval of_string : string -> 'a ttval of_float : float -> 'a ttval of_int : int -> 'a ttval add : t -> 'a tt -> 'b tt -> unitval add_ui : t -> 'a tt -> int -> unitval sub : t -> 'a tt -> 'b tt -> unitval sub_ui : t -> 'a tt -> int -> unitval ui_sub : t -> int -> 'a tt -> unitval mul : t -> 'a tt -> 'b tt -> unitval mul_si : t -> 'a tt -> int -> unitval addmul : t -> 'a tt -> 'b tt -> unitval addmul_ui : t -> 'a tt -> int -> unitval submul : t -> 'a tt -> 'b tt -> unitval submul_ui : t -> 'a tt -> int -> unitval mul_2exp : t -> 'a tt -> int -> unitval neg : t -> 'a tt -> unitval abs : t -> 'a tt -> unitc stands for ceiling, f for floor, and t for truncate (rounds toward 0).val cdiv_q : t -> 'a tt -> 'b tt -> unitval cdiv_r : t -> 'a tt -> 'b tt -> unitval cdiv_qr : t -> t -> 'a tt -> 'b tt -> unitval cdiv_q_ui : t -> 'a tt -> int -> intval cdiv_r_ui : t -> 'a tt -> int -> intval cdiv_qr_ui : t -> t -> 'a tt -> int -> intval cdiv_ui : 'a tt -> int -> intval cdiv_q_2exp : t -> 'a tt -> int -> unitval cdiv_r_2exp : t -> 'a tt -> int -> unitval fdiv_q : t -> 'a tt -> 'b tt -> unitval fdiv_r : t -> 'a tt -> 'b tt -> unitval fdiv_qr : t -> t -> 'a tt -> 'b tt -> unitval fdiv_q_ui : t -> 'a tt -> int -> intval fdiv_r_ui : t -> 'a tt -> int -> intval fdiv_qr_ui : t -> t -> 'a tt -> int -> intval fdiv_ui : 'a tt -> int -> intval fdiv_q_2exp : t -> 'a tt -> int -> unitval fdiv_r_2exp : t -> 'a tt -> int -> unitval tdiv_q : t -> 'a tt -> 'b tt -> unitval tdiv_r : t -> 'a tt -> 'b tt -> unitval tdiv_qr : t -> t -> 'a tt -> 'b tt -> unitval tdiv_q_ui : t -> 'a tt -> int -> intval tdiv_r_ui : t -> 'a tt -> int -> intval tdiv_qr_ui : t -> t -> 'a tt -> int -> intval tdiv_ui : 'a tt -> int -> intval tdiv_q_2exp : t -> 'a tt -> int -> unitval tdiv_r_2exp : t -> 'a tt -> int -> unitval gmod : t -> 'a tt -> 'b tt -> unitval gmod_ui : t -> 'a tt -> int -> intval divexact : t -> 'a tt -> 'b tt -> unitval divexact_ui : t -> 'a tt -> int -> unitval divisible_p : 'a tt -> 'b tt -> boolval divisible_ui_p : 'a tt -> int -> boolval divisible_2exp_p : 'a tt -> int -> boolval congruent_p : 'a tt -> 'b tt -> 'c tt -> boolval congruent_ui_p : 'a tt -> int -> int -> boolval congruent_2exp_p : 'a tt -> 'b tt -> int -> boolval _powm : t -> 'a tt -> 'b tt -> 'c tt -> unitval _powm_ui : t -> 'a tt -> int -> 'b tt -> unitval powm : t -> 'a tt -> 'b tt -> modulo:'c tt -> unitval powm_ui : t -> 'a tt -> int -> modulo:'b tt -> unitval pow_ui : t -> 'a tt -> int -> unitval ui_pow_ui : t -> int -> int -> unitval root : t -> 'a tt -> int -> boolval sqrt : t -> 'a tt -> unitval _sqrtrem : t -> t -> 'a tt -> unitval sqrtrem : t -> remainder:t -> 'a tt -> unitval perfect_power_p : 'a tt -> boolval perfect_square_p : 'a tt -> boolval probab_prime_p : 'a tt -> int -> intval nextprime : t -> 'a tt -> unitval gcd : t -> 'a tt -> 'b tt -> unitval gcd_ui : t option -> 'a tt -> int -> intval _gcdext : t -> t -> t -> 'a tt -> 'b tt -> unitval gcdext : gcd:t -> alpha:t -> beta:t -> 'a tt -> 'b tt -> unitval lcm : t -> 'a tt -> 'b tt -> unitval lcm_ui : t -> 'a tt -> int -> unitval invert : t -> 'a tt -> 'b tt -> boolval jacobi : 'a tt -> 'b tt -> intval legendre : 'a tt -> 'b tt -> intval kronecker : 'a tt -> 'b tt -> intval kronecker_si : 'a tt -> int -> intval si_kronecker : int -> 'a tt -> intval remove : t -> 'a tt -> 'b tt -> intval fac_ui : t -> int -> unitval bin_ui : t -> 'a tt -> int -> unitval bin_uiui : t -> int -> int -> unitval fib_ui : t -> int -> unitval fib2_ui : t -> t -> int -> unitval lucnum_ui : t -> int -> unitval lucnum2_ui : t -> t -> int -> unitval cmp : 'a tt -> 'b tt -> intval cmp_d : 'a tt -> float -> intval cmp_si : 'a tt -> int -> intval cmpabs : 'a tt -> 'b tt -> intval cmpabs_d : 'a tt -> float -> intval cmpabs_ui : 'a tt -> int -> intval sgn : 'a tt -> intval gand : t -> 'a tt -> 'b tt -> unitval ior : t -> 'a tt -> 'b tt -> unitval xor : t -> 'a tt -> 'b tt -> unitval com : t -> 'a tt -> unitval popcount : 'a tt -> intval hamdist : 'a tt -> 'b tt -> intval scan0 : 'a tt -> int -> intval scan1 : 'a tt -> int -> intval setbit : t -> int -> unitval clrbit : t -> int -> unitval tstbit : 'a tt -> int -> boolGmp_random moduleval _import : t ->
       (int, Bigarray.int32_elt, Bigarray.c_layout) Bigarray.Array1.t ->
       int -> int -> unitval _export : 'a tt ->
       int -> int -> (int, Bigarray.int32_elt, Bigarray.c_layout) Bigarray.Array1.tval import : dest:t ->
       (int, Bigarray.int32_elt, Bigarray.c_layout) Bigarray.Array1.t ->
       order:int -> endian:int -> unitval export : 'a tt ->
       order:int ->
       endian:int -> (int, Bigarray.int32_elt, Bigarray.c_layout) Bigarray.Array1.tval fits_int_p : 'a tt -> boolval odd_p : 'a tt -> boolval even_p : 'a tt -> boolval size : 'a tt -> intval sizeinbase : 'a tt -> int -> intval fits_ulong_p : 'a tt -> boolval fits_slong_p : 'a tt -> boolval fits_uint_p : 'a tt -> boolval fits_sint_p : 'a tt -> boolval fits_ushort_p : 'a tt -> boolval fits_sshort_p : 'a tt -> bool