summaryrefslogtreecommitdiff
path: root/nbtheory.cpp
diff options
context:
space:
mode:
authorJeffrey Walton <noloader@gmail.com>2021-03-04 22:49:25 -0500
committerJeffrey Walton <noloader@gmail.com>2021-03-04 22:49:25 -0500
commit8e9cb9d9d8f4ed2423600d232860b7db49091e8a (patch)
tree83010d5a5527f1c043a554e3b897903ded413d50 /nbtheory.cpp
parent1a5346c6c797b585dbc761c0d5c93c0073dee843 (diff)
downloadcryptopp-git-8e9cb9d9d8f4ed2423600d232860b7db49091e8a.tar.gz
Whitespace check-in
Diffstat (limited to 'nbtheory.cpp')
-rw-r--r--nbtheory.cpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/nbtheory.cpp b/nbtheory.cpp
index 8634cc1d..a6087a0b 100644
--- a/nbtheory.cpp
+++ b/nbtheory.cpp
@@ -1,4 +1,4 @@
-// nbtheory.cpp - originally written and placed in the public domain by Wei Dai
+// nbtheory.cpp - originally written and placed in the public domain by Wei Dai
#include "pch.h"
@@ -490,7 +490,7 @@ Integer MihailescuProvablePrime(RandomNumberGenerator &rng, unsigned int pbits)
// progression p = p_0 + \lambda * q2 = p_0 + 2 * \lambda * q,
// with q the recursively generated prime above. We will be able
// to use Lucas tets for proving primality. A trick of Quisquater
- // allows taking q > cubic_root(p) rather than square_root: this
+ // allows taking q > cubic_root(p) rather than square_root: this
// decreases the recursion.
p.Randomize(rng, minP, maxP, Integer::ANY, 1, q2);