euclidean: Find greatest common divisor of two numbers.
In kelly-ly/LAB-3: assignment
Description
Usage
Arguments
Value
References
Examples
Description
Find greatest common divisor of two numbers.
Usage
1
euclidean(x1, x2)
Arguments
x1
number 1
x2
number 2
Value
The greatest common divisor of x1 and x2
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
kelly-ly/LAB-3 documentation built on Nov. 4, 2019, 3:46 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.
Description Usage Arguments Value References Examples
Description
Find greatest common divisor of two numbers.
Usage
1 | euclidean(x1, x2)
|
Arguments
x1 |
number 1 |
x2 |
number 2 |
Value
The greatest common divisor of x1 and x2
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.