coprime

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

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

numbers

Number-Theoretic Functions

coprime function

<dl> <dt>n, m</dt>
<dd>integer scalars</dd></dl>

Arguments

Coprimality — coprime

<dl>

 <dt>n, m</dt>
<dd>integer scalars</dd>

</dl>

coprime: Coprimality

Description

Usage

Value

Arguments

Details

See Also

Examples