euclidean: Greatest Common Divisor of two numbers.
In OmidLavakhamseh/lab03: Greatest Common Divisor and Shortest Path
Description
Usage
Arguments
Details
Value
Author(s)
References
Examples
Description
Find the Greatest Common Divisor of two given numbers
Usage
1
euclidean(num1, num2)
Arguments
num1
A number.
num2
A number.
Details
Should assert that the arguments are numeric scalars or integers.
Value
The Greatest Common Divisor
Author(s)
Hamed
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
OmidLavakhamseh/lab03 documentation built on Dec. 18, 2021, 5:35 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 Details Value Author(s) References Examples
Description
Find the Greatest Common Divisor of two given numbers
Usage
1 | euclidean(num1, num2)
|
Arguments
num1 |
A number. |
num2 |
A number. |
Details
Should assert that the arguments are numeric scalars or integers.
Value
The Greatest Common Divisor
Author(s)
Hamed
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
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.