Description Usage Arguments Value References
Takes two numeric integer numbers and find its maximum commom divisor
1 | euclidian(first_number, second_number)
|
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 |
maximum commom divisor betwen first_number and second_ number
https://en.wikipedia.org/wiki/Euclidean_algorithm
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.