gcd: Greatest Common Divisor
In Peacock.test: Two and Three Dimensional Kolmogorov-Smirnov Two-Sample Tests
Description
Usage
Arguments
Details
Value
Author(s)
Examples
Description
This function returns the greatest common divisor of two integers
Usage
1
gcd(x, y)
Arguments
x
a nonnegative integer
y
a nonnegative integer
Details
The function utilizes the Euclidean algorithm to compute the greatest common divisor of two integers
Value
An integer, which is the greatest common divisor. If both arguments are zero, then the returned value is 1.
Author(s)
Yuanhui Xiao
Examples
1
2
3
4
x <- 4
y <- 6
d <- gcd(x, y)
d
Example output
[1] 2
Peacock.test documentation built on May 2, 2019, 4:50 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.
Description Usage Arguments Details Value Author(s) Examples
Description
This function returns the greatest common divisor of two integers
Usage
1 | gcd(x, y)
|
Arguments
x |
a nonnegative integer |
y |
a nonnegative integer |
Details
The function utilizes the Euclidean algorithm to compute the greatest common divisor of two integers
Value
An integer, which is the greatest common divisor. If both arguments are zero, then the returned value is 1.
Author(s)
Yuanhui Xiao
Examples
1 2 3 4 | x <- 4
y <- 6
d <- gcd(x, y)
d
|
Example output
[1] 2
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.