gcd: Greatest Common Divisor
In MiscMath: Miscellaneous Mathematical Tools
gcd R Documentation
Greatest Common Divisor
Description
Greatest common divisor or factor for all elements of a positive-integer-valued vector.
Usage
gcd(x)
Arguments
x
a numeric vector consisting of at least two positive integer values.
Details
The gcd is calculated using the Euclidean algorithm applied to successive pairs of the
elements of x.
Value
a numeric constant containing the greatest common divisor.
Examples
x <- c(81, 57, 333)
gcd(x)
MiscMath documentation built on April 13, 2025, 9:07 a.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.
| gcd | R Documentation |
Greatest Common Divisor
Description
Greatest common divisor or factor for all elements of a positive-integer-valued vector.
Usage
gcd(x)
Arguments
x |
a numeric vector consisting of at least two positive integer values. |
Details
The gcd is calculated using the Euclidean algorithm applied to successive pairs of the elements of x.
Value
a numeric constant containing the greatest common divisor.
Examples
x <- c(81, 57, 333)
gcd(x)
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.