numbers (version 0.7-5)

coprime: 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

Value

Logical, being TRUE if the numbers are coprime.

Details

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

See Also

GCD

Examples

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