math_gcd: Greatest Common Divisor
In tesselle/arkhe: Tools for Cleaning Rectangular Data
math_gcd 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 numeric vector.
Value
A numeric vector.
Author(s)
N. Frerebeau
See Also
Other mathematic functions:
math_lcm()
tesselle/arkhe documentation built on Feb. 22, 2024, 8:18 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| math_gcd | 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()
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.