euclidean: Takes the euclidian algorithm
In vasterlund/Lab3_Albin_Eric: Lab3
Description
Usage
Arguments
Value
References
Examples
Description
An algorithm that computes the greatest common divisor (GDC) of two numeric numbers.
Usage
1
euclidean(a, b)
Arguments
a
shall be a numeric value and a scalar
b
shall be a numeric value and a scalar
Value
Returns a numeric scalar that is the greatest common divisor of a and b.
References
The info about the algorithm can be found at this link
wikepedia.
Examples
1
2
vasterlund/Lab3_Albin_Eric documentation built on May 14, 2019, 8:56 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 References Examples
Description
An algorithm that computes the greatest common divisor (GDC) of two numeric numbers.
Usage
1 | euclidean(a, b)
|
Arguments
a |
shall be a numeric value and a scalar |
b |
shall be a numeric value and a scalar |
Value
Returns a numeric scalar that is the greatest common divisor of a and b.
References
The info about the algorithm can be found at this link wikepedia.
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.