Encyclopedia > P > Pairwise coprime
Pairwise coprime
In mathematics, especially number theory, a set of integers is said to be pairwise coprime (or pairwise relatively prime) if every pair of integers a and b in the set are coprime (that is, have no common divisors apart from 1). The concept of pairwise coprimality is important in applications of the Chinese remainder theorem.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)