[libmath-prime-util-perl] 13/40: Make sure n is odd to get exact results from lucas_sequence
Partha P. Mukherjee
ppm-guest at moszumanska.debian.org
Thu May 21 18:49:03 UTC 2015
This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.30
in repository libmath-prime-util-perl.
commit 83b385fbc340aaa061314930010b2d566c7dabe2
Author: Dana Jacobsen <dana at acm.org>
Date: Thu Jun 27 20:32:28 2013 -0700
Make sure n is odd to get exact results from lucas_sequence
---
t/17-pseudoprime.t | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/t/17-pseudoprime.t b/t/17-pseudoprime.t
index 36eb7bf..8d553e3 100644
--- a/t/17-pseudoprime.t
+++ b/t/17-pseudoprime.t
@@ -86,7 +86,7 @@ my %lucas_sequences = (
"49001 25 117 24501" => [20933,18744,19141],
"18971 10001 -1 4743" => [5866,14421,18970],
"18971 10001 -1 4743" => [5866,14421,18970],
- "3613982120 1 -1 3613982121" => [609064756,513522106,3613982119],
+ "3613982123 1 -1 3613982124" => [0,3613982121,1],
"3613982121 1 -1 3613982122" => [2586640546,2746447323,1],
"3613982121 1 -1 1806991061" => [3535079342,1187662808,3613982120],
"547968611 1 -1 547968612" => [1,3,1],
@@ -199,8 +199,8 @@ while (my($params, $expect) = each (%lucas_sequences)) {
{
my $fufail = 0;
- foreach my $i (1 .. 5000) {
- my $n = int(rand(1000000000)) + 1;
+ foreach my $i (1 .. 100) {
+ my $n = 2*int(rand(1000000000)) + 1;
my $ispfu = !!is_frobenius_underwood_pseudoprime($n);
my $prime = !!is_prime($n);
if ($ispfu != $prime) {
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git
More information about the Pkg-perl-cvs-commits
mailing list