Description Usage Arguments Value References Examples
Given 2 values (x and y), the function choose the greatest (for example x) one and replace it with modular of the other (x mod y) until remainer is equal to zero.
1 | euclidean(x, y)
|
x |
first number |
y |
second number |
returns greater common divisor of two value
1 | euclidean(100, 1000)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.