diff options
| author | dos-reis <gdr@axiomatics.org> | 2008-04-03 04:23:42 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2008-04-03 04:23:42 +0000 |
| commit | 001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532 (patch) | |
| tree | da9e2fe5d81ff4cd7709d12e44b8c3e348b8a8e3 /src/algebra/ghensel.spad.pamphlet | |
| parent | a7bab9a6c2070d05e2dbd256ce455079c8ced385 (diff) | |
| download | open-axiom-001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532.tar.gz | |
Replace `^=' with `~='.
Diffstat (limited to 'src/algebra/ghensel.spad.pamphlet')
| -rw-r--r-- | src/algebra/ghensel.spad.pamphlet | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/algebra/ghensel.spad.pamphlet b/src/algebra/ghensel.spad.pamphlet index 79d49c13..5643e7e2 100644 --- a/src/algebra/ghensel.spad.pamphlet +++ b/src/algebra/ghensel.spad.pamphlet @@ -63,7 +63,7 @@ GeneralHenselPackage(RP,TP):C == T where exactquo(u:TP,v:TP,p:RP):Union(TP,"failed") == invlcv:=modInverse(leadingCoefficient v,p) r:=monicDivide(u,reduction(invlcv*v,p)) - reduction(r.remainder,p) ^=0 => "failed" + reduction(r.remainder,p) ~=0 => "failed" reduction(invlcv*r.quotient,p) FP:=EuclideanModularRing(RP,TP,RP,reduction,merge,exactquo) @@ -78,7 +78,7 @@ GeneralHenselPackage(RP,TP):C == T where factlist=[] => [[pol] for pol in fln] maxd := +/[degree f for f in fln] quo 2 auxfl:List List TP := [] - for poly in fln while factlist^=[] repeat + for poly in fln while factlist~=[] repeat factlist := [term for term in factlist | ^member?(poly,term)] dp := degree poly for term in factlist repeat @@ -112,7 +112,7 @@ GeneralHenselPackage(RP,TP):C == T where fln = nfln and zero?(err:=poly-*/fln) => leave "finished" fln := nfln Modulus := prime*Modulus - if constp^=0 then fln:=cons(constp,fln) + if constp~=0 then fln:=cons(constp,fln) [fln,Modulus] completeHensel(m:TP,tl1:List TP,prime:RP,bound:PI) == @@ -127,9 +127,9 @@ GeneralHenselPackage(RP,TP):C == T where dfn :NonNegativeInteger := nm lcm1 := leadingCoefficient m mm := lcm1*m - while dfn>0 and (factlist := genFact(fln,factlist))^=[] repeat + while dfn>0 and (factlist := genFact(fln,factlist))~=[] repeat auxfl := [] - while factlist^=[] repeat + while factlist~=[] repeat auxl := factlist.first factlist := factlist.rest tc := reduceCoef((lcm1 * */[coefficient(poly,0) |