Description Usage Arguments Value References
Euclid's algorithm is an efficient method for computing the greatest common divisor of two numbers. The largest number that divides both of them without leaving a remainder.
1 | euclidean(a, b)
|
a |
A number. |
b |
A number. |
A number, which is the greatest common divisor.
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.