https://github.com/cran/pracma
Tip revision: 71455748623ef69836470c75c5f9384f6e872d45 authored by HwB on 28 June 2011, 00:00:00 UTC
version 0.6-3
version 0.6-3
Tip revision: 7145574
coprime.Rd
\name{coprime}
\alias{coprime}
\title{Coprimality}
\description{
Determine whether two numbers are coprime, i.e. do not have a common
prime divisor.
}
\usage{
coprime(n,m)
}
\arguments{
\item{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.
}
\seealso{
\code{\link{GCD}}
}
\examples{
coprime(46368, 75025) # Fibonacci numbers are relatively prime to each other
coprime(1001, 1334)
}
\keyword{ arith }