math_gcd {arkhe} | R Documentation |
Greatest Common Divisor
Description
Computes the greatest common divisor (GCD) of two integer using the Euclidean algorithm.
Usage
math_gcd(x, y)
## S4 method for signature 'numeric,numeric'
math_gcd(x, y)
Arguments
x , y |
A |
Value
A numeric
vector.
Author(s)
N. Frerebeau
See Also
Other mathematic functions:
math_lcm()
[Package arkhe version 1.7.0 Index]