Description Usage Arguments Value Examples
Computes the greatest common divisor with several algorithms available. The default algorithm is the recursive method, which is typically faster than the others.
1 | gcd(a, b, method = "recursive")
|
a |
First integer |
b |
Second integer |
method |
Specifies the algorithm used to calculate the greatest common divisior. Defaults to 'recursive', which is generally faster than other methods. Other algorithms available include 'division' and 'subtraction'. |
The greatest common divisor
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.