Description Usage Arguments Value Examples
euclidian() can find the greatest common divisor of two numbers.
1 | euclidean(num1, num2)
|
num1 |
Integer number |
num2 |
Interger number |
Interger number
1 2 3 4 | number1 <- 91
number2 <- 26
gcd <- euclidean(number1, number2)
gcd
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.