euclidean: Find the greatest common divisor of two numbers
In Er-Prakhar/Lab003: Package for lab 3
Description
Usage
Arguments
Value
See Also
Examples
Description
euclidean returns the greatest common divisor of two values provided
as arguments.
Pseudocode taken from the Wikipedia page for the Euclidean algorithm.
Usage
1
euclidean(a, b)
Arguments
a, b
Non negative integers.
Value
Greatest common divisor of a and b.
See Also
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
euclidean(100, 1000)
Er-Prakhar/Lab003 documentation built on Dec. 17, 2021, 7:21 p.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 See Also Examples
Description
euclidean returns the greatest common divisor of two values provided
as arguments.
Pseudocode taken from the Wikipedia page for the Euclidean algorithm.
Usage
1 | euclidean(a, b)
|
Arguments
a, b |
Non negative integers. |
Value
Greatest common divisor of a and b.
See Also
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1 | euclidean(100, 1000)
|
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.