coprime: Coprimality
In numbers: Number-Theoretic Functions
coprime R Documentation
Coprimality
Description
Determine whether two numbers are coprime, i.e. do not have a common
prime divisor.
Usage
coprime(n,m)
Arguments
n, m
integer scalars
Details
Two numbers are coprime iff their greatest common divisor is 1.
Value
Logical, being TRUE if the numbers are coprime.
See Also
GCD
Examples
coprime(46368, 75025) # Fibonacci numbers are relatively prime to each other
coprime(1001, 1334)
numbers documentation built on Nov. 23, 2022, 9:06 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.
| coprime | R Documentation |
Coprimality
Description
Determine whether two numbers are coprime, i.e. do not have a common prime divisor.
Usage
coprime(n,m)
Arguments
n, m |
integer scalars |
Details
Two numbers are coprime iff their greatest common divisor is 1.
Value
Logical, being TRUE if the numbers are coprime.
See Also
GCD
Examples
coprime(46368, 75025) # Fibonacci numbers are relatively prime to each other coprime(1001, 1334)
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.