Provides number-theoretic functions for factorization, prime
numbers, twin primes, primitive roots, modular logarithm and
inverses, extended GCD, Farey series and continuous fractions.
Includes Legendre and Jacobi symbols, some divisor functions,
Euler's Phi function, etc.

Number-Theoretic Functions

package-ubuntu-20.04-r-4.0.5#cran#numbers-0.8-1

Determine whether two numbers are coprime, i.e. do not have a common
prime divisor.

<table summary="R argblock"><tr valign="top">
<td><code>n, m</code></td>
<td>
integer scalars
</td>
</tr></table>

Two numbers are coprime iff their greatest common divisor is 1.

Logical, being TRUE if the numbers are coprime.

coprime(46368, 75025)  # Fibonacci numbers are relatively prime to each other
coprime(1001, 1334)

package-ubuntu-20.04-r-4.0.5#cran#numbers-0.8-1#docs#coprime

coprime

Description

Usage

Arguments

Details

Value

See Also

Examples

numbers

We don't support your browser anymore