[NumericPrelude] Polynomial.divMod bug with respect to denormalized divisor

[Henning Thielemann]

Am 24.02.2014 15:18, schrieb Dominic Steinitz:

> Thanks for fixing it so quickly. I was just playing: I wanted to write a general Euclid’s algorithm that works on integers and also on polynomials. It should work for any integral domain (I think - my knowledge is very rusty). But now I have run out of time and have to work on a presentation.

The Euclid implementation in PrincipalIdealDomain should work both for 
integers and polynomials:
 
http://hackage.haskell.org/package/numeric-prelude-0.4.0.3/docs/src/Algebra-PrincipalIdealDomain.html#euclid