Coprime integers

In number theory, two integers a and b are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1.[1] Consequently, any prime number that divides a does not divide b, and vice versa. This is equivalent to their greatest common divisor (gcd) being 1.[2] One says also a is prime to b or a is coprime with b.

The numerator and denominator of a reduced fraction are coprime. The numbers 14 and 25 are coprime, despite the fact that neither considered individually is a prime number, since 1 is their only common divisor. On the other hand, 14 and 21 are not coprime, because they are both divisible by 7.

Notation and testingEdit

Standard notations for relatively prime integers a and b are: gcd(a, b) = 1 and (a, b) = 1. In their 1989 textbook, Ronald Graham, Donald Knuth, and Oren Patashnik proposed that the notation   be used to indicate that a and b are relatively prime and that the term "prime" be used instead of coprime (as in a is prime to b).[3]

A fast way to determine whether two numbers are coprime is given by the Euclidean algorithm and its faster variants such as binary GCD algorithm or Lehmer's GCD algorithm.

The number of integers coprime with a positive integer n, between 1 and n, is given by Euler's totient function, also known as Euler's phi function, φ(n).

A set of integers can also be called coprime if its elements share no common positive factor except 1. A stronger condition on a set of integers is pairwise coprime, which means that a and b are coprime for every pair (a, b) of different integers in the set. The set {2, 3, 4} is coprime, but it is not pairwise coprime since 2 and 4 are not relatively prime.


The numbers 1 and −1 are the only integers coprime with every integer, and they are the only integers that are coprime with 0.

A number of conditions are equivalent to a and b being coprime:

As a consequence of the third point, if a and b are coprime and brbs (mod a), then rs (mod a).[5] That is, we may "divide by b" when working modulo a. Furthermore, if b1 and b2 are both coprime with a, then so is their product b1b2 (i.e., modulo a it is a product of invertible elements, and therefore invertible);[6] this also follows from the first point by Euclid's lemma, which states that if a prime number p divides a product bc, then p divides at least one of the factors b, c.

As a consequence of the first point, if a and b are coprime, then so are any powers ak and bm.

If a and b are coprime and a divides the product bc, then a divides c.[7] This can be viewed as a generalization of Euclid's lemma.

Figure 1. The numbers 4 and 9 are coprime. Therefore, the diagonal of a 4 × 9 lattice does not intersect any other lattice points

The two integers a and b are coprime if and only if the point with coordinates (a, b) in a Cartesian coordinate system is "visible" from the origin (0,0), in the sense that there is no point with integer coordinates on the line segment between the origin and (a, b). (See figure 1.)

In a sense that can be made precise, the probability that two randomly chosen integers are coprime is 6/π2 (see pi), which is about 61%. See below.

Two natural numbers a and b are coprime if and only if the numbers 2a − 1 and 2b − 1 are coprime.[8] As a generalization of this, following easily from the Euclidean algorithm in base n > 1:


Coprimality in setsEdit

A set of integers S = {a1, a2, .... an} can also be called coprime or setwise coprime if the greatest common divisor of all the elements of the set is 1. For example, the integers 6, 10, 15 are coprime because 1 is the only positive integer that divides all of them.

If every pair in a set of integers is coprime, then the set is said to be pairwise coprime (or pairwise relatively prime, mutually coprime or mutually relatively prime). Pairwise coprimality is a stronger condition than setwise coprimality; every pairwise coprime finite set is also setwise coprime, but the reverse is not true. For example, the integers 4, 5, 6 are (setwise) coprime (because the only positive integer dividing all of them is 1), but they are not pairwise coprime (because gcd(4, 6) = 2).

The concept of pairwise coprimality is important as a hypothesis in many results in number theory, such as the Chinese remainder theorem.

It is possible for an infinite set of integers to be pairwise coprime. Notable examples include the set of all prime numbers, the set of elements in Sylvester's sequence, and the set of all Fermat numbers.

Coprimality in ring idealsEdit

Two ideals A and B in a commutative ring R are called coprime (or comaximal) if A + B = R. This generalizes Bézout's identity: with this definition, two principal ideals (a) and (b) in the ring of integers Z are coprime if and only if a and b are coprime. If the ideals A and B of R are coprime, then AB = AB; furthermore, if C is a third ideal such that A contains BC, then A contains C. The Chinese remainder theorem can be generalized to any commutative ring, using coprime ideals.

Probability of coprimalityEdit

Given two randomly chosen integers a and b, it is reasonable to ask how likely it is that a and b are coprime. In this determination, it is convenient to use the characterization that a and b are coprime if and only if no prime number divides both of them (see Fundamental theorem of arithmetic).

Informally, the probability that any number is divisible by a prime (or in fact any integer)   is  ; for example, every 7th integer is divisible by 7. Hence the probability that two numbers are both divisible by p is  , and the probability that at least one of them is not is  . Any finite collection of divisibility events associated to distinct primes is mutually independent. For example, in the case of two events, a number is divisible by primes p and q if and only if it is divisible by pq; the latter event has probability 1/pq. If one makes the heuristic assumption that such reasoning can be extended to infinitely many divisibility events, one is led to guess that the probability that two numbers are coprime is given by a product over all primes,


Here ζ refers to the Riemann zeta function, the identity relating the product over primes to ζ(2) is an example of an Euler product, and the evaluation of ζ(2) as π2/6 is the Basel problem, solved by Leonhard Euler in 1735.

There is no way to choose a positive integer at random so that each positive integer occurs with equal probability, but statements about "randomly chosen integers" such as the ones above can be formalized by using the notion of natural density. For each positive integer N, let PN be the probability that two randomly chosen numbers in   are coprime. Although PN will never equal   exactly, with work[9] one can show that in the limit as  , the probability   approaches  .

More generally, the probability of k randomly chosen integers being coprime is  .

Generating all coprime pairsEdit

The order of generation of coprime pairs by this algorithm. First node (2,1) is marked red, its three children are shown in orange, third generation is yellow, and so on in the rainbow order.

All pairs of positive coprime numbers   (with  ) can be arranged in two disjoint complete ternary trees, one tree starting from   (for even–odd and odd–even pairs),[10] and the other tree starting from   (for odd–odd pairs).[11] The children of each vertex   are generated as follows:

  • Branch 1:  
  • Branch 2:  
  • Branch 3:  

This scheme is exhaustive and non-redundant with no invalid members.


In machine design, an even, uniform gear wear is achieved by choosing the tooth counts of the two gears meshing together to be relatively prime. When a 1:1 gear ratio is desired, a gear relatively prime to the two equal-size gears may be inserted between them.

In pre-computer cryptography, some Vernam cipher machines combined several loops of key tape of different lengths. Many rotor machines combine rotors of different numbers of teeth. Such combinations work best when the entire set of lengths are pairwise coprime.[12][13][14][15]


This concept can be extended to other algebraic structures than  ; for example, polynomials whose greatest common divisor is 1 are called coprime polynomials.

See alsoEdit


  1. ^ Eaton, James S. Treatise on Arithmetic. 1872. May be downloaded from:
  2. ^ Hardy & Wright 2008, p. 6
  3. ^ Graham, R. L.; Knuth, D. E.; Patashnik, O. (1989), Concrete Mathematics / A Foundation for Computer Science, Addison-Wesley, p. 115, ISBN 0-201-14236-8
  4. ^ Ore 1988, p. 47
  5. ^ Niven & Zuckerman 1966, p. 22, Theorem 2.3(b)
  6. ^ Niven & Zuckerman 1966, p. 6, Theorem 1.8
  7. ^ Niven & Zuckerman 1966, p.7, Theorem 1.10
  8. ^ Rosen 1992, p. 140
  9. ^ This theorem was proved by Ernesto Cesàro in 1881. For a proof, see Hardy & Wright 2008, Theorem 332
  10. ^ Saunders, Robert & Randall, Trevor (July 1994), "The family tree of the Pythagorean triplets revisited", Mathematical Gazette, 78: 190–193, doi:10.2307/3618576.
  11. ^ Mitchell, Douglas W. (July 2001), "An alternative characterisation of all primitive Pythagorean triples", Mathematical Gazette, 85: 273–275, doi:10.2307/3622017.
  12. ^ Klaus Pommerening. "Cryptology: Key Generators with Long Periods".
  13. ^ David Mowry. "German Cipher Machines of World War II". 2014. p. 16; p. 22.
  14. ^ Dirk Rijmenants. "Origins of One-time pad".
  15. ^ Gustavus J. Simmons. "Vernam-Vigenère cipher".


Further readingEdit

  • Lord, Nick (March 2008), "A uniform construction of some infinite coprime sequences", Mathematical Gazette, 92: 66–70.