Description Usage Arguments Details Value Source
euclidean
returns the greatest common divisor of two integers.
1 | euclidean(x, y)
|
x |
a number or integer. |
y |
a number or integer. |
The algorithm is a method for computing the largest possible number that divides two numbers without a remainder. It works by replacing the larger number by its difference with the smaller of the two numbers and repeating this process until the two numbers become equal and the remainder is zero.
If the two inputs are integer or numeric, then the output will be an integer, specifically the highest number that will divide the two inputs. Otherwise the function will stop and show an error stating the inputs need to be an integer or numeric.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.