Max safe integer.

Min safe integer.

Integer division truncated towards zero.

integer remainder, satisfying

quot x y * y + rem x y == x

Integer division truncated towards negative infinity.

integer modulus, satisfying

div x y * y + mod x y == x

simultaneous quot and rem

simultaneous div and mod

Sign of x number. The functions abs and signum should satisfy the law:

abs x * signum x == x

For real numbers, the signum is either -1 (negative), 0 (zero) or 1 (positive).

even predicate

odd predicate

gcd x y is the non-negative factor of both x and y of which every common factor of x and y is also x factor; for example gcd 4 2 = 2, gcd (-4) 6 = 2, gcd 0 4 = 4. gcd 0 0 = 0. (That is, the common divisor that is "greatest" in the divisibility preordering.)

Note: Since for signed fixed-width integer types, abs minBound < 0, the result may be negative if one of the arguments is minBound (and necessarily is if the other is 0 or minBound) for such types.

lcm x y is the smallest positive integer that both x and y divide.