diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-03-12 19:17:32 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-03-12 19:17:32 +0000 |
| commit | c93e84048964194e5674e859d6bd8827010f09f6 (patch) | |
| tree | 407ca23d232bf3f974550fce0175c49495ef49c0 /src/algebra/modgcd.spad.pamphlet | |
| parent | 52fddea19454dc2b9bcb54c6edd5a4cd4f5765a9 (diff) | |
| download | open-axiom-c93e84048964194e5674e859d6bd8827010f09f6.tar.gz | |
* src/algebra/: Systematically use negative? when comparing for
greater than 0.
Diffstat (limited to 'src/algebra/modgcd.spad.pamphlet')
| -rw-r--r-- | src/algebra/modgcd.spad.pamphlet | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/algebra/modgcd.spad.pamphlet b/src/algebra/modgcd.spad.pamphlet index a30dd0cc..b094a863 100644 --- a/src/algebra/modgcd.spad.pamphlet +++ b/src/algebra/modgcd.spad.pamphlet @@ -77,7 +77,7 @@ InnerModularGcd(R,BP,pMod,nextMod):C == T modularGcdPrimitive(listf : List BP) :BP == empty? listf => 0$BP g := first listf - for f in rest listf | not zero? f while degree g > 0 repeat + for f in rest listf | not zero? f while positive? degree g repeat g:=modGcdPrimitive(g,f) g @@ -89,7 +89,7 @@ InnerModularGcd(R,BP,pMod,nextMod):C == T minpol:=1$BP -- extract a monomial gcd mdeg:= "min"/[minimumDegree f for f in listf] - if mdeg>0 then + if positive? mdeg then minpol1:= monomial(1,mdeg) listf:= [(f exquo minpol1)::BP for f in listf] minpol:=minpol*minpol1 |