Greatest common divisor (GCD) domains.
GCD domains are integral domains in which every pair of nonzero elements have a greatest common divisor. They can also be characterized as non-Noetherian analogues of unique factorization domains.
- class IntegralDomain a => GCDDomain a where
- gcd' :: a -> a -> (a, a, a)
- propGCDDomain :: (Eq a, GCDDomain a, Arbitrary a, Show a) => a -> a -> a -> Property
Documentation
class IntegralDomain a => GCDDomain a whereSource
GCD domains
gcd' :: a -> a -> (a, a, a)Source
Compute gcd(a,b) = (g,x,y) such that g = gcd(a,b) and a = gx b = gy and a, b /= 0
BezoutDomain a => GCDDomain a |