euclidean: Finding the greatest common divisor (GCD)
In rryesuafuga/Lab03: Package lab3
Description
Usage
Arguments
Value
Author(s)
Source
Description
This function finds the GCD by using modulus function and while loop
Usage
1
euclidean(a, b)
Arguments
a
integer
b
integer
Value
an integer equal to GCD
Author(s)
Reuel, Martin, Vinay
Source
rryesuafuga/Lab03 documentation built on May 9, 2019, 7:36 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 Author(s) Source
Description
This function finds the GCD by using modulus function and while loop
Usage
1 | euclidean(a, b)
|
Arguments
a |
integer |
b |
integer |
Value
an integer equal to GCD
Author(s)
Reuel, Martin, Vinay
Source
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.