euclidian: algorithm to find the greatest common divisor of two numbers.
In rebinhosini/AdvancedR: Lab3
Description
Usage
Arguments
Value
References
Description
Takes two numeric integer numbers and find its maximum commom divisor
Usage
1
euclidian(first_number, second_number)
Arguments
first_number
A numeric value to be divided by all it numbers smaller or equal than them, arranged in a vector
second_number
A numeric value to be divided by the vector created
Value
maximum commom divisor betwen first_number and second_ number
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
rebinhosini/AdvancedR documentation built on May 27, 2019, 4:01 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
Takes two numeric integer numbers and find its maximum commom divisor
Usage
1 | euclidian(first_number, second_number)
|
Arguments
first_number |
A numeric value to be divided by all it numbers smaller or equal than them, arranged in a vector |
second_number |
A numeric value to be divided by the vector created |
Value
maximum commom divisor betwen first_number and second_ number
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.