diff options
| author | dos-reis <gdr@axiomatics.org> | 2008-08-31 13:56:20 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2008-08-31 13:56:20 +0000 |
| commit | e8df02fd0970cad96e174ffb5b7707081266f371 (patch) | |
| tree | 5e5322ecc176e9e8bb2bc5caad00409a0a687f42 /src/algebra/modgcd.spad.pamphlet | |
| parent | 3c58b07e75e2c6cc1cd57d2902aa305335161e5e (diff) | |
| download | open-axiom-e8df02fd0970cad96e174ffb5b7707081266f371.tar.gz | |
* algebra/boolean.spad.pamphlet (Boolean): Remove definition of
operator ^.
* algebra/aggcat.spad.pamphlet (BitAggregate): Likewise.
* algebra/color.spad.pamphlet: Replace use of '^' as logical
negation by 'not'.
* algebra/ddfact.spad.pamphlet: Likewise.
* algebra/fortran.spad.pamphlet: Likewise.
* algebra/gaussfac.spad.pamphlet: Likewise.
* algebra/gbeuclid.spad.pamphlet: Likewise.
* algebra/gbintern.spad.pamphlet: Likewise.
* algebra/ghensel.spad.pamphlet: Likewise.
* algebra/groebsol.spad.pamphlet: Likewise.
* algebra/ideal.spad.pamphlet: Likewise.
* algebra/idecomp.spad.pamphlet: Likewise.
* algebra/indexedp.spad.pamphlet: Likewise.
* algebra/listgcd.spad.pamphlet: Likewise.
* algebra/mfinfact.spad.pamphlet: Likewise.
* algebra/modgcd.spad.pamphlet: Likewise.
* algebra/multfact.spad.pamphlet: Likewise.
* algebra/multsqfr.spad.pamphlet: Likewise.
* algebra/newpoint.spad.pamphlet: Likewise.
* algebra/npcoef.spad.pamphlet: Likewise.
* algebra/permgrps.spad.pamphlet: Likewise.
* algebra/pgcd.spad.pamphlet: Likewise.
* algebra/pleqn.spad.pamphlet: Likewise.
* algebra/qalgset.spad.pamphlet: Likewise.
* algebra/radeigen.spad.pamphlet: Likewise.
* algebra/rep2.spad.pamphlet: Likewise.
* algebra/solverad.spad.pamphlet: Likewise.
* algebra/space.spad.pamphlet: Likewise.
* algebra/view2D.spad.pamphlet: Likewise.
* algebra/strap/: Update cached Lisp translateion
* share/algebra/: Update databases.
Diffstat (limited to 'src/algebra/modgcd.spad.pamphlet')
| -rw-r--r-- | src/algebra/modgcd.spad.pamphlet | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/algebra/modgcd.spad.pamphlet b/src/algebra/modgcd.spad.pamphlet index f93e1898..4edd4475 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 | ^zero? f while degree g > 0 repeat + for f in rest listf | not zero? f while degree g > 0 repeat g:=modGcdPrimitive(g,f) g @@ -159,8 +159,8 @@ InnerModularGcd(R,BP,pMod,nextMod):C == T dp:=gcd(fp,gp) dgp :=euclideanSize dp if dgp =0 then return 1$BP - if dgp=dg and ^(f exquo g case "failed") then return g - if dgp=df and ^(g exquo f case "failed") then return f + if dgp=dg and not (f exquo g case "failed") then return g + if dgp=df and not (g exquo f case "failed") then return f dgp > testdeg => "next prime" ldp:FP:= ((lcdp:=leadingCoefficient(dp::BP)) = 1) => @@ -184,7 +184,7 @@ InnerModularGcd(R,BP,pMod,nextMod):C == T soFarModulus:=prime soFar:=dp::BP testdeg:=dgp - if ^zeroChar and euclideanSize(prime)>1 then + if not zeroChar and euclideanSize(prime)>1 then result:=dp::BP test(f,g,result) => return result -- this is based on the assumption that the caller of this package, |