Übersetzung für 'common divisor' von Englisch nach Deutsch

common divisor

gemeinsamer Teiler {m}math.

---

greatest common divisor <gcd>

größter gemeinsamer Teiler {m} <ggT>math.

---

Werbung

divisor

Divisor {m} [Nenner des Bruches]math.

aliquot divisor

aliquoter Teiler {m}math.

divisor function

Teilerfunktion {f}math.

Cartier divisor

Cartierdivisor {m} [auch: Cartier-Divisor]math.

principal divisor

Hauptdivisor {m}math.

Weil divisor

Weildivisor {m} [auch: Weil-Divisor]math.

prime divisor

Primteiler {m}math.

trivial divisor

trivialer Teiler {m}math.

proper divisor

echter Teiler {m}math.

elementary divisor

Elementarteiler {m}math.

zero divisor

Nullteiler {m}math.

divisor class group

Divisorklassengruppe {f}math.

elementary divisor theorem

Elementarteilersatz {m}math.

left zero divisor

Linksnullteiler {m}math.

divisor latch low

niederwertiger Teiler {m}

right zero divisor

Rechtsnullteiler {m}math.

common {adj}

üblich

gebräuchlich [verbreitet]

von niedriger Klassepol.sociol.

allgemein

• In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder.
• 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.
• Greek mathematicians later used algorithms in 240 BC in the sieve of Eratosthenes for finding prime numbers, and the Euclidean algorithm for finding the greatest common divisor of two numbers.
• Two whole numbers "m" and "n" are called coprime if their greatest common divisor is 1, that is, if there is no prime number that divides both of them.
• This notion can be extended to polynomials (see Polynomial greatest common divisor) and other commutative rings (see [...] below).

• As an example, the greatest common divisor of 15 and 69 is 3, and 3 can be written as a combination of 15 and 69 as [...] with Bézout coefficients −9 and 2.