gcdPrime: Greatest Common Divisor
In isaacmichaud/IMisc: Isaac Michaud's Personal R Package
Description
Usage
Arguments
Details
Value
Examples
Description
This function computes the greatest common divisior (GCD) of two positive integers using the Euclidian algorithm.
Usage
1
gcdPrime(num1, num2)
Arguments
num1
The first integer
num2
The second integer
Details
This was written some abstract algebra class.
Value
gcd
Examples
1
gcdPrime(16,24)
isaacmichaud/IMisc documentation built on July 1, 2019, 10:22 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 Examples
Description
This function computes the greatest common divisior (GCD) of two positive integers using the Euclidian algorithm.
Usage
1 | gcdPrime(num1, num2)
|
Arguments
num1 |
The first integer |
num2 |
The second integer |
Details
This was written some abstract algebra class.
Value
gcd
Examples
1 | gcdPrime(16,24)
|
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.