Maximal common divisor

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

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. Lua error in package.lua at line 80: module 'strict' not found.


<templatestyles src="Asbox/styles.css"></templatestyles>