Tweak PartialFactorization call when proving primality

Namely, by passing it the 'cheap' option (which implies the FactIntPartial option), as the surrounding code would suggest. This makes calling e.g. IsPrimeInt(100000000000000000000000000000000000000000000000151); with FactInt loaded almost as fast as without it loaded.
gap-system · Jan 17, 2018 · 17cc656 · 17cc656
1 parent acec523
commit 17cc656
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/hpcgap/lib/primality.gi b/hpcgap/lib/primality.gi
@@ -578,8 +578,8 @@ function(N)
   # try straightforward method first
   if cheap=true and FactIntPartial=true then
     to_check:=Concatenation(
-      List(Set(PartialFactorization(N-1,7)),p->["F",p]),
-      List(Set(PartialFactorization(N+1,7)),p->["L",p]));
+      List(Set(PartialFactorization(N-1,7 : cheap)),p->["F",p]),
+      List(Set(PartialFactorization(N+1,7 : cheap)),p->["L",p]));
     if [] <> PrimalityProof_VerifyStructure(N,to_check)
     then return to_check;
     else Info(InfoPrimeInt,1,"Straightforward Fermat-Lucas primality proof failed on ",N);

diff --git a/lib/primality.gi b/lib/primality.gi
@@ -578,8 +578,8 @@ function(N)
   # try straightforward method first
   if cheap=true and FactIntPartial=true then
     to_check:=Concatenation(
-      List(Set(PartialFactorization(N-1,7)),p->["F",p]),
-      List(Set(PartialFactorization(N+1,7)),p->["L",p]));
+      List(Set(PartialFactorization(N-1,7 : cheap)),p->["F",p]),
+      List(Set(PartialFactorization(N+1,7 : cheap)),p->["L",p]));
     if [] <> PrimalityProof_VerifyStructure(N,to_check)
     then return to_check;
     else Info(InfoPrimeInt,1,"Straightforward Fermat-Lucas primality proof failed on ",N);