relatively prime

(redirected from Coprime)
Also found in: Wikipedia.

relatively prime

[′rel·ə‚tiv·lē ′prīm]
(mathematics)
Integers m and n are relatively prime if there are integers p and q so that pm + qn = 1; equivalently, if they have no common factors other than 1.

relatively prime

(mathematics)
Having no common divisors (greater than 1).

Two numbers are said to be relativey prime if there is no number greater than unity that divides both of them evenly.

For example, 10 and 33 are relativly prime. 15 and 33 are not relatively prime, since 3 is a divisor of both.
References in periodicals archive ?
This endomorphism is an automorphism if and only if k and 5 are coprime.
and 5 both of multiple a is it if only and if 45 of multiple a is integer positive a coprime, are 9 and 5 As 9.
member of] V, it suffices to show that n/2 + 1 is coprime to [n.
Since m - 1 and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] are coprime, by the Chinese Remainder Theorem the equivalences k [equivalent to] [p.
Choose e such that 1 < e <^(n) and e and n are coprime.
Wang and Deng [5] proposed an operator-based robust nonlinear multivariable tracking control for a manipulator with uncertainties by using a robust right coprime factorization approach and discussed the robust stability in the presence of model uncertainties.
It is always assumed that N is prime, q is much larger than p, and p is coprime to q.
We say that V and V' are cohomologically coprime if V has vanishing G-cohomology and V' has vanishing G'-cohomology.
Then, since s and q are coprime we only need only show that m and n are also coprime, and then the fundamental theorem of arithmetic would compel the conclusion that in order for sq = mn, we must have s = m and q = n, or, paired the other way, s = n and q = m.
A large number of rotations can be sensed by combining multiple curved domain wall conduit devices with coprime numbers of loops developed with results from the PI s ERC starting grant.
Since n is coprime with p therefore the above polynomial is not additive in general.
To satisfy this condition the coefficients of linear form must be coprime with p and the value of check module must be equal to p [greater than or equal to] [2.