lcm: Computes the least common multiple of two integers, a and b.
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
The least common multiple is defined as the smallest possible positive integer that
is divisible by both a and b, and is usually denoted lcm(a,b) or
LCM(a,b). The function implementation for finding the least common multiple takes advantage
of the relation between the greatest common divisor and the least common multiple, such that:
lcm(a,b) = \bigg(\frac{|a|}{gcd(a,b)} \bigg) \space |b|
Usage
1
lcm(a, b)
Arguments
a
First integer
b
Second integer
Value
the least common multiple of the two given integers
Examples
1
2
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
The least common multiple is defined as the smallest possible positive integer that is divisible by both a and b, and is usually denoted lcm(a,b) or LCM(a,b). The function implementation for finding the least common multiple takes advantage of the relation between the greatest common divisor and the least common multiple, such that:
lcm(a,b) = \bigg(\frac{|a|}{gcd(a,b)} \bigg) \space |b|
Usage
1 | lcm(a, b)
|
Arguments
a |
First integer |
b |
Second integer |
Value
the least common multiple of the two given integers
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.