gcd: Greatest common divisor
In FRACTION: Numeric Number into Fraction
gcd R Documentation
Greatest common divisor
Description
Calculate the greatest common divisor between two numbers
Usage
gcd(a, b)
Arguments
a
a is greater than 0 while a is whole number
b
b is greater than 0 while b is whole number
Details
Ues Euclidean algorithm
Value
the greatest common divisor between a and b
Author(s)
OuYang Ming
References
Friedrich Leisch, 2008 Creating R packages: A Tutorial
Zhang Jinlong, How to create R package under Windows
FAQ in R-PROJECT
Examples
a=14
b=32
c=gcd(a,b)
FRACTION documentation built on Aug. 24, 2023, 9:08 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
Calculate the greatest common divisor between two numbers
Usage
gcd(a, b)
Arguments
a |
a is greater than 0 while a is whole number |
b |
b is greater than 0 while b is whole number |
Details
Ues Euclidean algorithm
Value
the greatest common divisor between a and b
Author(s)
OuYang Ming
References
Friedrich Leisch, 2008 Creating R packages: A Tutorial Zhang Jinlong, How to create R package under Windows FAQ in R-PROJECT
Examples
a=14
b=32
c=gcd(a,b)
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.