[flint] 18/24: Clarified where our BPSW test comes from.

[felix salfelder]

This is an automated email from the git hooks/post-receive script.

felix-guest pushed a commit to branch master
in repository flint.

commit 7c8e20965ce754665157e4e1fd6566f5d10ff37b
Author: William Hart <goodwillhart at googlemail.com>
Date:   Thu Jun 19 16:47:02 2014 +0100

    Clarified where our BPSW test comes from.
---
 ulong_extras/doc/ulong_extras.txt | 14 ++++++++++----
 1 file changed, 10 insertions(+), 4 deletions(-)

diff --git a/ulong_extras/doc/ulong_extras.txt b/ulong_extras/doc/ulong_extras.txt
index 8758e1a..606611d 100644
--- a/ulong_extras/doc/ulong_extras.txt
+++ b/ulong_extras/doc/ulong_extras.txt
@@ -810,10 +810,16 @@ int n_is_probabprime_fibonacci(mp_limb_t n)
 
 int n_is_probabprime_BPSW(mp_limb_t n)
 
-    Implements the Baillie--Pomerance--Selfridge--Wagstaff probable primality
-    test. There are no known counterexamples to this being a primality test.
-    For further details, see~\citep{CraPom2005}. Up to $2^64$ this has been 
-    checked.
+    Implements a Baillie--Pomerance--Selfridge--Wagstaff probable primality
+    test. This is a variant of the usual BPSW test (which only uses Fermat
+    and Lucas tests, see Baillie and Wagstaff~\citep{BaiWag1980}) making use 
+    of the comment on page 143 of~\citep{CraPom2005} regarding Fibonacci
+    pseudoprimes.
+
+    There are no known counterexamples to this being a primality test.
+
+    Up to $2^64$ the test we use has been checked against tables of 
+    pseudoprimes. Thus it is a primality test up to this limit.
 
 int n_is_probabprime_lucas(mp_limb_t n)
 

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/flint.git