find_gcd: Greatest common divisor
In jannes-m/velo: An R package for bicycle-related calculations
find_gcd R Documentation
Greatest common divisor
Description
Find the greatest common divisor of two integers.
Usage
find_gcd(x = NULL, y = NULL)
Arguments
x
an integer of length 1
y
an integer of length 1
Author(s)
Jannes Muenchow
Examples
find_gcd(45, 15)
find_gcd(1289, 124)
jannes-m/velo documentation built on May 23, 2023, 2:41 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.
| find_gcd | R Documentation |
Greatest common divisor
Description
Find the greatest common divisor of two integers.
Usage
find_gcd(x = NULL, y = NULL)
Arguments
x |
an integer of length 1 |
y |
an integer of length 1 |
Author(s)
Jannes Muenchow
Examples
find_gcd(45, 15)
find_gcd(1289, 124)
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.