diff options
Diffstat (limited to 'src/algebra/intfact.spad.pamphlet')
| -rw-r--r-- | src/algebra/intfact.spad.pamphlet | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/algebra/intfact.spad.pamphlet b/src/algebra/intfact.spad.pamphlet index 4c4be09d..f405476f 100644 --- a/src/algebra/intfact.spad.pamphlet +++ b/src/algebra/intfact.spad.pamphlet @@ -152,7 +152,7 @@ IntegerPrimesPackage(I:IntegerNumberSystem): with nm1 := n-1 q := (nm1) quo two k : NonNegativeInteger - for k in 1.. while not odd? q repeat q := q quo two + for k: free in 1.. while not odd? q repeat q := q quo two -- q = (n-1) quo 2**k for largest possible k n < JaeschkeLimit => @@ -458,7 +458,7 @@ IntegerFactorizationPackage(I): Exports == Implementation where if n>1 then ls := concat!(ls, ["prime",n,1]$FFE) return makeFR(1, ls) m : Integer - for m in 0.. while zero?(n rem d) repeat n := n quo d + for m: free in 0.. while zero?(n rem d) repeat n := n quo d if positive? m then ls := concat!(ls, ["prime",d,convert m]$FFE) d := d+s @@ -497,7 +497,7 @@ IntegerFactorizationPackage(I): Exports == Implementation where insert!(x-y,a,c) (d := PollardSmallFactor20 n) case I => m' : NonNegativeInteger - for m' in 0.. while zero?(n rem d) repeat n := n quo d + for m': free in 0.. while zero?(n rem d) repeat n := n quo d insert!(d, a, m' * c) if n > 1 then insert!(n, a, c) -- an elliptic curve factorization attempt should be made here |