euclidean: Algorithm for finding the greatest common divisor, Euclidean...
In SimonJonsson/lab3: lab3 code
Description
Usage
Arguments
Value
References
Description
Algorithm for finding the greatest common divisor, Euclidean algorithm
Usage
1
euclidean(a, b)
Arguments
a
integer
b
integer
Value
an integer which is the gcd(a,b)
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
SimonJonsson/lab3 documentation built on May 14, 2019, 8:58 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
Description
Algorithm for finding the greatest common divisor, Euclidean algorithm
Usage
1 | euclidean(a, b)
|
Arguments
a |
integer |
b |
integer |
Value
an integer which is the gcd(a,b)
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
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.