The Chinese remainder theorem concerns a system of linear congruences in which all moduli are pairwise this. For integers a and b with this property, the largest integer not obtainable from a positive linear combination of a and b is equal to the product of a and b minus a minus b. The Euler totient function returns the number of integers that share this property with and are less than or equal to the argument. The Euclidean algorithm returns one for numbers with this pr
The Chinese remainder theorem concerns a system of linear congruences in which all moduli are pairwise this. For integers a and b with this property, the largest integer not obtainable from a positive linear combination of a and b is equal to the product of a and b minus a minus b. The Euler totient function returns the number of integers that share this property with and are less than or equal to the argument. The Euclidean algorithm returns one for numbers with this property, held by the numerator and denominator of a fraction in lowest terms. For 10 points, name this property of positive integers that do not share any common divisors.
The Chinese remainder theorem concerns a system of linear congruences in which all moduli are pairwise this.
coprime [or relatively prime; do not accept or prompt on "prime"]