euclidean: Find greatest common divisor between two numbers
In brbatv/lab3: Euclidean and Dijkstra Algorithms
Description
Usage
Arguments
Value
Examples
Description
Find greatest common divisor between two numbers
Usage
1
euclidean(a, b)
Arguments
a
A number.
b
A number.
Value
Greatest common division using Euclidean's algorithm
Examples
1
2
brbatv/lab3 documentation built on May 9, 2019, 6:03 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 Examples
Description
Find greatest common divisor between two numbers
Usage
1 | euclidean(a, b)
|
Arguments
a |
A number. |
b |
A number. |
Value
Greatest common division using Euclidean's algorithm
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.