Maximal common divisor

Maximal common divisor

In abstract algebra, particularly ring theory, maximal common divisors are an abstraction of the number theory concept of greatest common divisor (GCD). This definition is slightly more general than GCDs, and may exist in rings in which GCDs do not. Halter-Koch (1998) provides the following definition.[1]

d ∈ H is a maximal common divisor of a subset, B ⊂ H, if the following criteria are met:

  1. d|b for all b ∈ B
  2. Suppose c ∈ H d|c and c|b for all b ∈ a. Then c \simeq d.

References

  1. ^ Halter-Koch, Franz (1998). Ideal systems. Marcel Dekker. ISBN 0824701860. 

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For …   Wikipedia

  • Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… …   Wikipedia

  • Ring (mathematics) — This article is about algebraic structures. For geometric rings, see Annulus (mathematics). For the set theory concept, see Ring of sets. Polynomials, represented here by curves, form a ring under addition and multiplication. In mathematics, a… …   Wikipedia

  • Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… …   Wikipedia

  • Linear feedback shift register — [ xor gate provides feedback to the register that shifts bits from left to right. The maximal sequence consists of every possible state except the 0000 state.] A linear feedback shift register (LFSR) is a shift register whose input bit is a… …   Wikipedia

  • Principal ideal domain — In abstract algebra, a principal ideal domain, or PID is an integral domain in which every ideal is principal, i.e., can be generated by a single element.Principal ideal domains are thus mathematical objects which behave somewhat like the… …   Wikipedia

  • Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… …   Wikipedia

  • Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”