Linked from

The 22 pages that link to Coprime integers, each with the reason it gives.

• Fundamental theorem of arithmeticRelated: Euclid's lemma follows from the behavior of primes relative to coprime factors.

• Dirichlet's theorem on arithmetic progressionsRelated: Coprimality of the first term and difference is precisely the eligibility condition.

• Euclid's lemmaRelated: If the prime does not divide one factor, that factor is coprime to the prime.

• Multiplicative functionRelated: The multiplicative identity is required precisely for coprime inputs.

• Trial divisionRelated: Skipping candidates sharing small prime factors relies on recognizing coprimality.

• Divisor functionRelated: Multiplicativity combines divisor-function values for coprime factors.

• Least common multipleRelated: For coprime inputs, their product is their least common multiple.

• Unique factorizationRelated: Euclid's lemma follows from the fact that a prime coprime to one factor must divide the other.

• Multiplicative orderRelated: A residue class has a multiplicative inverse modulo n exactly when it is coprime to n.

• Euclid's theoremRelated: The constructed number is coprime to the product of all listed primes.

• Lowest termsRelated: A fraction is in lowest terms exactly when its numerator and denominator are coprime.

• Extended Euclidean algorithmRelated: For coprime inputs, the algorithm produces a linear combination equal to 1.

• abc conjectureRelated: The conjecture concerns pairwise coprime a, b, and c.

• PseudoprimeRelated: The standard Fermat pseudoprime condition applies only to bases coprime to the candidate.

• Beal's conjectureRelated: A counterexample requires the three bases to be pairwise coprime.

• Proof that π is irrationalRelated: A rational representation can be reduced to coprime numerator and denominator.