gcd_subtraction: Computes the Greatest Common Divisor of two integers using...
In aschleg/numberr: Numberr is a package containing number-theoretic algorithms and functions primarily written in C++ using Rcpp
Description
Usage
Arguments
Value
Examples
Description
Computes the greatest common divisor using the original implementation of the algorithm by
Euclid. In this version of the algorithm, the quotient q_k and remainder r_k
is calculated by repeated division by subtraction. Therefore, in this implementation of the
greatest common divisor algorithm, the modulo operation in the division implementation is
replaced by division by repeated subtraction.
Usage
1
gcd_subtraction(a, b)
Arguments
a
First integer
b
Second integer
Value
The greatest common divisor
Examples
1
2
gcd_subtraction(21, 6)
gcd_subtraction(25, 5)
aschleg/numberr documentation built on May 14, 2019, 10:31 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 Examples
Description
Computes the greatest common divisor using the original implementation of the algorithm by Euclid. In this version of the algorithm, the quotient q_k and remainder r_k is calculated by repeated division by subtraction. Therefore, in this implementation of the greatest common divisor algorithm, the modulo operation in the division implementation is replaced by division by repeated subtraction.
Usage
1 | gcd_subtraction(a, b)
|
Arguments
a |
First integer |
b |
Second integer |
Value
The greatest common divisor
Examples
1 2 | gcd_subtraction(21, 6)
gcd_subtraction(25, 5)
|
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.