euclidean: Computes the greatest common divisor (GCD) of two integers...
In ahmedNwayyir/myFirstRPackage: First R Package
Description
Usage
Arguments
Value
References
Examples
Description
Computes the greatest common divisor (GCD) of two integers (numbers),
Usage
1
euclidean(a, b)
Arguments
a
A number.
b
A number.
Value
The largest number that divides a and b.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
ahmedNwayyir/myFirstRPackage documentation built on July 7, 2020, 1:15 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 Value References Examples
Description
Computes the greatest common divisor (GCD) of two integers (numbers),
Usage
1 | euclidean(a, b)
|
Arguments
a |
A number. |
b |
A number. |
Value
The largest number that divides a and b.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
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.