aboutsummaryrefslogtreecommitdiffstats
path: root/src/lib/math/numbertheory
diff options
context:
space:
mode:
authorlloyd <[email protected]>2015-04-12 22:35:42 +0000
committerlloyd <[email protected]>2015-04-12 22:35:42 +0000
commit196b4b3f8bf93c343d59cb69f2b25413bf20b917 (patch)
tree276d5648954a001204145f2df74a83d0f75d1f1a /src/lib/math/numbertheory
parent1f3676ff66fa6b444a45ce7196d9316de25d792d (diff)
Remove the stray binary character making Python3 unhappy, remove
encoding= flags since they are not needed anymore and broke Python2.
Diffstat (limited to 'src/lib/math/numbertheory')
-rw-r--r--src/lib/math/numbertheory/numthry.cpp5
1 files changed, 2 insertions, 3 deletions
diff --git a/src/lib/math/numbertheory/numthry.cpp b/src/lib/math/numbertheory/numthry.cpp
index 565cc543a..5fa8d4541 100644
--- a/src/lib/math/numbertheory/numthry.cpp
+++ b/src/lib/math/numbertheory/numthry.cpp
@@ -259,7 +259,7 @@ size_t mr_test_iterations(size_t n_bits, size_t prob, bool random)
/*
* For randomly chosen numbers we can use the estimates from
- * http://www.math.dartmouth.edu/~carlp/PDF/paper88.pdf‎
+ * http://www.math.dartmouth.edu/~carlp/PDF/paper88.pdf
*
* These values are derived from the inequality for p(k,t) given on
* the second page.
@@ -311,8 +311,7 @@ bool is_prime(const BigInt& n, RandomNumberGenerator& rng,
for(size_t i = 0; i != test_iterations; ++i)
{
const BigInt a = BigInt::random_integer(rng, 2, n_minus_1);
-
- BigInt y = pow_mod(a);
+ const BigInt y = pow_mod(a);
if(mr_witness(std::move(y), reducer, n_minus_1, s))
return false;