Any fixed MR iterations is probably wrong for somebody. Allow the user

to specify a probability as well as if n was randomly chosen or not.
If the input is random use a better bounds to reduce the number of
needed tests.

1 files changed, 1 insertions, 1 deletions

diff --git a/src/cmd/factor.cpp b/src/cmd/factor.cpp
index 7a5018d62..5f6d82f8c 100644
--- a/src/cmd/factor.cpp
+++ b/src/cmd/factor.cpp
@@ -100,7 +100,7 @@ std::vector<BigInt> factorize(const BigInt& n_in,
 
    while(n != 1)
       {
-      if(check_prime(n, rng))
+      if(is_prime(n, rng))
          {
          factors.push_back(n);
          break;