Description Usage Arguments Value References
euclidean
The Euclidian algorithm can find the greatest common divisor of two numbers.
1 | euclidean(a, b)
|
a |
Integer number |
b |
Interger number |
An interger represents the greatest common divisor of two numbers.
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.