Module num::integer

Structs

ExtendedGcd	Greatest common divisor and Bézout coefficients
IterBinomial	An iterator over binomial coefficients.

Traits

Integer
Roots	Provides methods to compute an integer's square root, cube root, and arbitrary nth root.

Functions

binomial	Calculate the binomial coefficient.
cbrt	Returns the truncated principal cube root of an integer -- see Roots::cbrt.
div_ceil	Ceiled integer division
div_floor	Floored integer division
div_mod_floor	Simultaneous floored integer division and modulus
div_rem	Simultaneous integer division and modulus
gcd	Calculates the Greatest Common Divisor (GCD) of the number and other. The result is always positive.
gcd_lcm	Calculates the Greatest Common Divisor (GCD) and Lowest Common Multiple (LCM) of the number and other.
lcm	Calculates the Lowest Common Multiple (LCM) of the number and other.
mod_floor	Floored integer modulus
multinomial	Calculate the multinomial coefficient.
nth_root	Returns the truncated principal nth root of an integer -- see Roots::nth_root.
sqrt	Returns the truncated principal square root of an integer -- see Roots::sqrt.