R: Greatest Common Divisor (GCD) and Least Common Multiple (LCM)

gcd.bigz {gmp} | R Documentation

## Greatest Common Divisor (GCD) and Least Common Multiple (LCM)

### Description

Compute the greatest common divisor (GCD) and least common multiple (LCM) 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

### Author(s)

Antoine Lucas

### 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)

    ## or
    (a <- as.bigz("82696155787249022588"))
    (b <- as.bigz("65175989479756205392"))
    gcd(a,b) # 4
    stopifnot(gcd(a,b) * lcm.bigz(a,b) == a * b)

[Package gmp version 0.5-13.2 Index]