gmp (version 0.5-4)

gcd.bigz: Greatest Common Divisor, Least Common Multiple

Description

Compute the greatest common divisor (GCD) and least common multiple (LCD) of two (big) integers.

Usage

## S3 method for class 'bigz':
gcd(a, b)
lcm.bigz(a, b)

Arguments

a,b

Either integer, numeric, bigz or a string value; if a string, either starting with 0x for hexadecimal, 0b for binary or without prefix for decimal values.

Value

• An element of class bigz

References

The GNU MP Library, see http://gmplib.org

See Also

gcdex

Examples

gcd.bigz(210,342) # or also
lcm.bigz(210,342)
a <- 210 ; b <- 342
stopifnot(gcd.bigz(a,b) * lcm.bigz(a,b) == a * b)