Coprime integers
In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1.
≈ 5 min read
Coprime integers. encyclopegia.org, snapshot enwiki-001374094077. /a/coprime-integers
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equivalent to their greatest common divisor (GCD) being 1.
One says also is prime to or is coprime with . The numbers 8 and 9 are coprime, despite the fact that neither—considered individually—is a prime number, since 1 is their only common divisor. On the other hand, 6 and 9 are not coprime, because they are both divisible by 3.
The numerator and denominator of a reduced fraction are coprime, by definition. \gcd\left(n^a - 1, n^b - 1\right) = n^{\gcd(a, b)} - 1. A set of integers S=\{a_1,a_2, \dots, a_n\} 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 ).
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. \prod_{\text{prime } p} \left(1-\frac{1}{p^2}\right) = \left( \prod_{\text{prime } p} \frac{1}{1-p^{-2}} \right)^{-1} = \frac{1}{\zeta(2)} = \frac{6}{\pi^2} \approx 0.607927102 \approx 61\%. Here refers to the Riemann zeta function, the identity relating the product over primes to is an example of an Euler product, and the evaluation of as 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 , let be the probability that two randomly chosen numbers in \{1,2,\ldots,N\} are coprime.
Although will never equal exactly, with work one can show that in the limit as N \to \infty, the probability approaches . More generally, the probability of randomly chosen integers being setwise coprime is
Generating all coprime pairs
at (2, 1). The root (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), and the other tree starting from (for odd–odd pairs).
The children of each vertex are generated as follows: Branch 1: (2m-n,m) Branch 2: (2m+n,m) Branch 3: (m+2n,n) This scheme is exhaustive and non-redundant with no invalid members. This can be proved by remarking that, if (a,b) is a coprime pair with a>b, then if a>3b, then (a,b) is a child of (m,n)=(a-2b, b) along branch 3; if 2b then (a,b) is a child of (m,n)=(b, a-2b) along branch 2; if b then (a,b) is a child of (m,n)=(b, 2b-a) along branch 1.
In all cases (m,n) is a "smaller" coprime pair with m>n. This process of "computing the father" can stop only if either a=2b or a=3b. In these cases, coprimality, implies that the pair is either (2,1) or (3,1).
Another (much simpler) way to generate a tree of positive coprime pairs (with ) is by means of two generators f:(m,n)\rightarrow(m+n,n) and g:(m,n)\rightarrow(m+n,m) , starting with the root (2,1) . The resulting binary tree, the Calkin–Wilf tree, is exhaustive and non-redundant, which can be seen as follows.
Given a coprime pair one recursively applies f^{-1} or g^{-1} depending on which of them yields a positive coprime pair with . Since only one does, the tree is non-redundant. Since by this procedure one is bound to arrive at the root, the tree is exhaustive.
Two ideals and in a commutative ring are called coprime (or comaximal) if A+B=R. This generalizes Bézout's identity: with this definition, two principal ideals ( ) and ( ) in the ring of integers are coprime if and only if and are coprime. If the ideals and of are coprime, then AB=A\cap B; furthermore, if is a third ideal such that contains , then contains .
The Chinese remainder theorem can be generalized to any commutative ring, using coprime ideals.
See also
Euclid's orchard Superpartient number
Further reading
.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1374094077 under CC BY-SA 4.0; modifications have been made.
References
1 claim could not be tied to a specific sentence and is listed in the table below instead.