euclidean: function for euclid or euclideans algorithm to find out the...
In muh-faizan-khalid/euclidspackage: Calculate GCD for two numbers using euclidean algorithm
Description
Usage
Arguments
Value
Examples
Description
function for euclid or euclideans algorithm
to find out the GCD of two numbers
Usage
1
euclidean(num1, num2)
Arguments
num1
is a number or an integer
num2
is a number or an integer
both parameters are inputs for euclidean
to find out their GCD
Value
the GCD(greatest common divisor)
Examples
1
2
muh-faizan-khalid/euclidspackage documentation built on Nov. 11, 2019, 1:18 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Examples
Description
function for euclid or euclideans algorithm to find out the GCD of two numbers
Usage
1 | euclidean(num1, num2)
|
Arguments
num1 |
is a number or an integer |
num2 |
is a number or an integer both parameters are inputs for euclidean to find out their GCD |
Value
the GCD(greatest common divisor)
Examples
1 2 |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.