[libmath-prime-util-perl] 22/29: New 3-base solution

[Partha P. Mukherjee]

This is an automated email from the git hooks/post-receive script.

ppm-guest pushed a commit to annotated tag v0.27
in repository libmath-prime-util-perl.

commit 66759374b683874b39202d7ea9de980bcfe3d8cb
Author: Dana Jacobsen <dana at acm.org>
Date:   Sun May 19 00:13:36 2013 -0700

    New 3-base solution
---
 factor.c | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/factor.c b/factor.c
index 4f2fc89..5a3a3b0 100644
--- a/factor.c
+++ b/factor.c
@@ -360,7 +360,7 @@ int _XS_is_prob_prime(UV n)
     bases[0] = 2; bases[1] = 7; bases[2] = 61; nbases = 3;
   }
 #else
-  /* Better bases from http://miller-rabin.appspot.com/, 10 Mar 2013 */
+  /* Better bases from http://miller-rabin.appspot.com/, 18 May 2013 */
   if (n < UVCONST(341531)) {
     bases[0] = UVCONST(9345883071009581737);
     nbases = 1;
@@ -368,10 +368,10 @@ int _XS_is_prob_prime(UV n)
     bases[0] = 15;
     bases[1] = UVCONST( 13393019396194701 );
     nbases = 2;
-  } else if (n < UVCONST(154639673381)) {
+  } else if (n < UVCONST(242175507817)) {
     bases[0] = 15;
-    bases[1] = UVCONST(  176006322 );
-    bases[2] = UVCONST( 4221622697 );
+    bases[1] = UVCONST(      7363882082 );
+    bases[2] = UVCONST( 211573017068182 );
     nbases = 3;
   } else if (n < UVCONST(47636622961201)) {
     bases[0] = 2;

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git