diff options
| author | dos-reis <gdr@axiomatics.org> | 2008-05-11 03:28:45 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2008-05-11 03:28:45 +0000 |
| commit | 51422a0c6bc0128cd5635a01c402ef56ad4ed770 (patch) | |
| tree | d7f4cb13310b177e1691acd1307eb420d70b2546 /src/algebra/intfact.spad.pamphlet | |
| parent | d2412069e4fc43a4bc6cc28ce4c57e02f8baee41 (diff) | |
| download | open-axiom-51422a0c6bc0128cd5635a01c402ef56ad4ed770.tar.gz | |
* interp/iterator.boot (compRepeatOrCollect): Don't iterator
variables and variables declared in a loop are local to that loop.
* interp/g-error.boot (needsToSplitMessage): New.
(errorSupervisor): Use it.
* interp/compiler.boot (compSymbol): Highlight erron=eous symbol.
* interp/wi1.boot (stackMessage): Remove duplicate.
* algebra/ffcat.spad.pamphlet (FiniteFieldCategory): Tidy.
* algebra/fff.spad.pamphlet (FiniteFieldFunctions): Likewie.
* algebra/groebsol.spad.pamphlet (GroebnerSolve): Likewise.
* algebra/intfact.spad.pamphlet (IntegerRoots): Likewise.
* algebra/mkfunc.spad.pamphlet (InputForm): Likewise.
* algebra/numtheor.spad.pamphlet (IntegerNumberTheoryFunctions):
Likewise.
* algebra/permgrps.spad.pamphlet (PermutationGroup): Likewise.
* algebra/random.spad.pamphlet (RandomFloatDistributions): Likewise.
* algebra/sgcf.spad.pamphlet
(SymmetricGroupCombinatoricFunctions): Likewise.
* algebra/triset.spad.pamphlet (PolynomialSetUtilitiesPackage):
Likewise.
* algebra/twofact.spad.pamphlet (TwoFactorize): Likewise.
Diffstat (limited to 'src/algebra/intfact.spad.pamphlet')
| -rw-r--r-- | src/algebra/intfact.spad.pamphlet | 6 |
1 files changed, 5 insertions, 1 deletions
diff --git a/src/algebra/intfact.spad.pamphlet b/src/algebra/intfact.spad.pamphlet index 316da86a..f5485d51 100644 --- a/src/algebra/intfact.spad.pamphlet +++ b/src/algebra/intfact.spad.pamphlet @@ -304,6 +304,7 @@ IntegerRoots(I:IntegerNumberSystem): Exports == Implementation where y := max(two, shift(1, (n::I+l-1) quo (n::I))) z:I := 1 n1:= (n-1)::NNI + x: I while z > 0 repeat x := y xn:= x**n1 @@ -401,12 +402,15 @@ IntegerFactorizationPackage(I): Exports == Implementation where r:I := 1 q:I := 1 G:I := 1 + ys: I + x: I until G > 1 repeat x := y + k: I for i in 1..convert(r)@Integer repeat y := (y*y+5::I) rem n q := (q*abs(x-y)) rem n - k:I := 0 + k := 0 until (k>=r) or (G>1) repeat ys := y for i in 1..convert(min(m,r-k))@Integer repeat |