From 538ecacdf17409acd687ad9123ebf2d6f6babf66 Mon Sep 17 00:00:00 2001 From: Torbjorn Granlund Date: Tue, 4 Oct 2011 00:12:26 +0200 Subject: Run 25 Miller-Rabin tests. --- demos/factorize.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'demos') diff --git a/demos/factorize.c b/demos/factorize.c index 464a5fc59..67cf0ccb3 100644 --- a/demos/factorize.c +++ b/demos/factorize.c @@ -231,7 +231,7 @@ factor_using_pollard_rho (mpz_t n, unsigned long a, unsigned long p) mpz_divexact (n, n, t1); /* divide by t1, before t1 is overwritten */ - if (!mpz_probab_prime_p (t1, 10)) + if (!mpz_probab_prime_p (t1, 25)) { do { @@ -257,7 +257,7 @@ factor_using_pollard_rho (mpz_t n, unsigned long a, unsigned long p) mpz_mod (x, x, n); mpz_mod (x1, x1, n); mpz_mod (y, y, n); - if (mpz_probab_prime_p (n, 10)) + if (mpz_probab_prime_p (n, 25)) { mpz_out_str (stdout, 10, n); fflush (stdout); @@ -296,7 +296,7 @@ factor (mpz_t t, unsigned long p) printf ("[is number prime?] "); fflush (stdout); } - if (mpz_probab_prime_p (t, 10)) + if (mpz_probab_prime_p (t, 25)) mpz_out_str (stdout, 10, t); else factor_using_pollard_rho (t, 1L, p); -- cgit v1.2.1