1 Definitions and basic concepts

A mutually coprime set is a set of integers in which any two different elements have greatest common divisor 1. In other words, no prime number divides two distinct members of the same set. The idea is central in elementary number theory because it organizes integers according to the absence of shared prime factors.

1.1 Coprimality and greatest common divisor

Two integers are coprime, or relatively prime, when their greatest common divisor is 1. This condition means that the numbers share no nontrivial common factor. For example, 8 and 15 are coprime because their only common divisor is 1, while 8 and 12 are not because they share a factor of 4.

1.2 Pairwise coprime versus mutually coprime

The terms pairwise coprime and mutually coprime are often used in the same way. Both indicate that every pair of distinct elements in the set is coprime. The emphasis on “pairwise” highlights the condition applied to each two-element subset, while “mutually” underscores that the property holds across the entire collection.

1.3 Finite and infinite sets

Mutually coprime sets may be finite or infinite. Finite examples are common in elementary applications, such as sets of distinct primes or selected integers with disjoint factorization patterns. Infinite examples also exist, such as the set of all prime numbers. In infinite settings, the pairwise condition remains the same, although structural questions may become more delicate.

1.4 Examples and non-examples

The set {2, 3, 5, 7} is mutually coprime because every pair consists of distinct primes. The set {6, 25, 49} is also mutually coprime, since 6 has prime factors 2 and 3, 25 has factor 5, and 49 has factor 7. By contrast, {6, 10, 15} is not mutually coprime because each pair has a common divisor greater than 1.

2 Fundamental properties

Mutually coprime sets have a simple factorization structure. Their members cannot share prime divisors, so arithmetic involving products, divisibility, and least common multiples often simplifies in a useful way.

2.1 Prime factorization viewpoint

From the prime factorization perspective, each element of a mutually coprime set uses a separate collection of prime factors. No prime may appear in two different members. This makes the set resemble a partition of prime divisibility among its elements.

2.2 Divisibility relations

If a set is mutually coprime, then any divisor of one element that is greater than 1 cannot divide another element of the same set. This implies strong restrictions on shared factors. In particular, if one element divides another and both are in the set, the smaller must be 1, since otherwise the two numbers would not be coprime.

2.3 Products of elements

Products of mutually coprime elements behave predictably because their prime factors do not overlap. This often leads to formulas for greatest common divisors and least common multiples that are simpler than in the general case.

2.3.1 Coprimality of an element with a product of others

In a mutually coprime set, any element is coprime to the product of the remaining elements. Since it shares no prime factor with any of them individually, it shares no prime factor with their product. This property is frequently used in proofs and constructions.

2.3.2 Consequences for shared prime factors

If a prime divides the product of several mutually coprime integers, then it must divide exactly one of them. More generally, any common divisor of a product of one subcollection and a product of a disjoint subcollection must be 1. This separation of prime factors is one reason mutually coprime sets are useful in arithmetic arguments.

2.4 Closure properties

Mutually coprime sets are not closed under arbitrary operations on their elements. Replacing one member by a multiple may destroy the property, since new prime factors can overlap with those already present. However, certain operations preserve pairwise coprimality, such as multiplying all members by the same integer only when that integer is 1, or replacing elements by values built from disjoint prime sets.

3 Equivalent characterizations

The defining condition can be restated in several equivalent ways. These formulations are often easier to apply in proofs involving gcds, prime divisors, or factorization patterns.

3.1 GCD conditions on subsets

A finite set is mutually coprime if and only if the greatest common divisor of every two-element subset is 1. For some applications, this can be strengthened: the gcd of any nonempty subset is 1 if the subset has at least two elements and the set is mutually coprime. The pairwise condition is the basic criterion from which these subset statements follow.

3.2 Characterization using prime divisors

A set of integers is mutually coprime precisely when no prime divisor occurs in more than one element. This means that for each prime, the set of members divisible by that prime has at most one element. The criterion provides a direct link between coprimality and prime factorization.

3.3 Characterization via pairwise disjoint prime supports

For each nonzero integer, its prime support is the set of primes dividing it. A set is mutually coprime if and only if the prime supports of its elements are pairwise disjoint. This description is especially convenient when working with numbers defined by products of primes or by arithmetic constructions that separate factor sets.

4 Construction of mutually coprime sets

There are many systematic ways to build mutually coprime sets. The simplest constructions use primes directly, while more elaborate ones assemble integers from nonoverlapping collections of primes.

4.1 Sets of distinct prime numbers

Any collection of distinct prime numbers is mutually coprime. Since each prime has no nontrivial divisors other than itself, two different primes cannot share a common factor greater than 1. This is the most basic source of examples.

4.2 Products of disjoint prime collections

Another common method is to assign each element a separate group of primes and define the element as the product of those primes. If the groups are disjoint, the resulting numbers are pairwise coprime. For instance, 2·3, 5·7, and 11·13 form a mutually coprime set.

4.3 Recursive and inductive constructions

Mutually coprime sets can be generated recursively by choosing each new integer to avoid the prime divisors already used. One may start with any integer and then select later terms from numbers composed only of fresh primes. Such inductive methods are often used to produce infinite sequences with the desired property.

5 Applications in number theory

Mutually coprime sets appear throughout number theory because they permit independent arithmetic mod each element. This independence underlies many standard techniques for solving congruences and analyzing divisibility.

5.1 Chinese remainder theorem

The Chinese remainder theorem applies especially well when moduli are pairwise coprime. In that setting, a system of congruences has a unique solution modulo the product of the moduli, provided the residues are compatible with the given moduli. Mutually coprime sets therefore supply natural collections of moduli for constructive problems.

5.2 Modular arithmetic and congruences

When moduli are pairwise coprime, congruence conditions can be treated separately and then recombined. This allows arithmetic problems to be split into simpler parts. The absence of shared prime factors also helps in analyzing invertibility modulo products of the numbers.

5.3 Least common multiple considerations

For pairwise coprime numbers, the least common multiple is simply their product. This is a major simplification compared with the general case. As a result, mutually coprime sets are often used when one wants a clean relationship between lcm and multiplication.

5.4 Diophantine equations

Pairwise coprimality is frequently useful in integer equations, especially when factoring expressions or comparing divisibility. If two terms are coprime, divisibility of a product may force divisibility of one factor alone. Such arguments are common in the study of linear combinations, parametrizations, and classical divisibility proofs.

Several nearby notions are closely connected to mutually coprime sets. These classes differ in terminology or in the exact strength of the condition, but they often overlap in practice.

6.1 Relatively prime sets

The phrase relatively prime set may refer more broadly to a set whose elements are collectively coprime in some sense. In many contexts it is used informally for pairwise coprime sets, though some authors reserve it for a weaker condition involving the gcd of the whole set. Because usage varies, the intended meaning is usually determined by context.

6.2 Pairwise coprime collections

Pairwise coprime collection is another direct synonym for mutually coprime set. It stresses the two-element condition and is often preferred in expository writing. The two terms are usually interchangeable in standard number-theoretic usage.

6.3 Sets with coprime product

In some settings one studies sets whose product is coprime to a given integer or to another product. This is a broader idea than mutual coprimality among the members themselves. Such sets arise when analyzing divisibility constraints relative to an external modulus.

6.4 Sets of integers with distinct prime support

A set with distinct prime support is one in which the prime factors attached to each element are disjoint from those of the others. This characterization is essentially equivalent to mutual coprimality. It is especially helpful when the integers are built from factorization data rather than listed explicitly.

7 Examples and special cases

Simple cases reveal much of the structure of mutually coprime sets. Even small examples illustrate the distinctions between pairwise coprime and merely collectively related numbers.

7.1 Two-element sets

Any two integers whose gcd is 1 form a mutually coprime set. Thus, every coprime pair is an example. The notion becomes more informative for sets with three or more elements, where all pairwise checks must succeed simultaneously.

7.2 Three-element sets

A three-element set is mutually coprime when each of its three pairs is coprime. For example, {4, 9, 25} has this property because the prime factors 2, 3, and 5 are all distinct. By contrast, {4, 6, 25} fails because 4 and 6 share a factor of 2.

7.3 Sets containing 1

Any set containing the integer 1 is automatically coprime with 1 in every pair involving it. Since gcd(1, n) = 1 for all integers n, the presence of 1 makes one element trivially compatible with the rest. The other members still need to be pairwise coprime among themselves.

7.4 Maximal mutually coprime sets within a range

Within a fixed interval of positive integers, a mutually coprime set may be maximal if no additional integer in the range can be added without breaking the property. Such sets depend strongly on the chosen range and are not usually unique. Questions about maximal size and classification connect mutual coprimality with combinatorial number theory.