- Minor optimization in Number is_safe_prime(n).

If `(n-1)/2` is a strong base-2 pseudoprime, but `n` is not a strong base-2 pseudoprime, there is no need to run a Lucas test on `(n-1)/2`.
trizen · Aug 1, 2020 · 08008d6 · 08008d6
1 parent e783fa7
commit 08008d6
Showing 1 changed file with 3 additions and 1 deletion.
diff --git a/lib/Sidef/Types/Number/Number.pm b/lib/Sidef/Types/Number/Number.pm
@@ -10985,7 +10985,9 @@ package Sidef::Types::Number::Number {
         _primality_pretest($t)
           || return Sidef::Types::Bool::Bool::FALSE;
 
-        (Math::Prime::Util::GMP::is_prob_prime($t) && Math::Prime::Util::GMP::is_strong_pseudoprime($n, 2))
+        (   Math::Prime::Util::GMP::is_strong_pseudoprime($t, 2)
+         && Math::Prime::Util::GMP::is_strong_pseudoprime($n, 2)
+         && Math::Prime::Util::GMP::is_strong_lucas_pseudoprime($t))
           ? Sidef::Types::Bool::Bool::TRUE
           : Sidef::Types::Bool::Bool::FALSE;
     }