euclidean: Find the Greatest Common Divisor (GCD) of two integers.
In Philhoels/Lab3AdvR: Uses the euclidean and dijkstra algorihtm
Description
Usage
Arguments
Value
References
Examples
Description
The Euclidean Algorithm is a technique used for finding the Greatest Common divisor of two integers.
Usage
1
euclidean(a, b)
Arguments
a
A number.
b
A number.
Value
The sum of a and b.
References
Examples
1
2
Philhoels/Lab3AdvR documentation built on May 9, 2019, 3:28 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
The Euclidean Algorithm is a technique used for finding the Greatest Common divisor of two integers.
Usage
1 | euclidean(a, b)
|
Arguments
a |
A number. |
b |
A number. |
Value
The sum of a and b.
References
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.