bigGcd
The greatest common divisor of a and b, computed via arbitrary-precision integers -- stays exact for magnitudes far beyond ordinary 128-bit arithmetic.
a(number) --b(number) --
The greatest common divisor of a and b, computed via arbitrary-precision integers -- stays exact for magnitudes far beyond ordinary 128-bit arithmetic.
a (number) -- b (number) -- base raised to a non-negative integer exponent, computed via arbitrary-precision integers -- stays an exact integer at any magnitude, unlike ordinary exponentiation which falls back to an approximate float once it outgrows native range.
base (number) -- exp (number) -- non-negative integerThe largest whole number <= x, exact at any size.
x (number) -- The smallest whole number >= x, exact at any size.
x (number) -- x rounded to the nearest whole number (halves away from zero), exact at any size.
x (number) -- x with its fractional part dropped (towards zero).
x (number) -- The fractional part x - trunc(x).
x (number) -- The numerator of x in lowest terms.
x (number) -- The denominator of x in lowest terms.
x (number) -- True if x is a whole number.
x (number) -- x as a mixed number, e.g. 7/2 is "3 1/2" and -7/2 is "-3 1/2".
x (number) --