Description Usage Arguments Value Author(s) References Examples
Euclidian algorithm to find the greatest common divisor of two numbers
1 | euclidean(a, b)
|
a |
An integer |
b |
An integer |
The greatest common divisor of a
and b
Simon and Mohamed
https://en.wikipedia.org/wiki/Euclidean_algorithm
1 2 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.