Description Usage Arguments Value References
Algorithm for finding the greatest common divisor, Euclidean algorithm
1 | euclidean(a, b)
|
a |
integer |
b |
integer |
an integer which is the gcd(a,b)
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.