Merge pull request #1917 from albinahlback/reference_granlund

Reference granlund
flintlib · Apr 11, 2024 · 8baab90 · 8baab90
2 parents 60f039b + 1e23f44
commit 8baab90
Show file tree

Hide file tree

Showing 3 changed files with 5 additions and 4 deletions.
diff --git a/doc/source/fmpz.rst b/doc/source/fmpz.rst
@@ -1403,7 +1403,7 @@ Primality testing
     `94` bits) the function fails silently and returns `-1`, otherwise, if
     `n` is proven prime by the pseudosquares method, return `1`.
 
-    Tests if `n` is a prime according to [Theorem 2.7] [LukPatWil1996]_.
+    Tests if `n` is a prime according to Theorem 2.7 in [LukPatWil1996]_.
 
     We first factor `N` using trial division up to some limit `B`.
     In fact, the number of primes used in the trial factoring is at

diff --git a/doc/source/references.rst b/doc/source/references.rst
@@ -129,7 +129,9 @@ References
 
 .. [GowWag2008] \Jason Gower and Sam Wagstaff : "Square form factoring" Math. Comp. 77, 2008, pp 551-588, https://doi.org/10.1090/S0025-5718-07-02010-8
 
-.. [GraMol2010] \Torbjorn Granlund and Niels Moller : Improved Division by Invariant Integers https://gmplib.org/~tege/division-paper.pdf
+.. [GraMol2010] \Torbjörn Granlund and Niels Möller : Improved Division by Invariant Integers, https://gmplib.org/~tege/division-paper.pdf
+
+.. [GraMon1994] \Törbjorn Granlund and Peter L. Montgomery : Division by Invariant Integers using Multiplication https://gmplib.org/~tege/divcnst-pldi94.pdf
 
 .. [HM2017] \J. van der Hoeven and B. Mourrain. "Efficient certification of numeric solutions to eigenproblems", MACIS 2017, 81-94, (2017), https://hal.archives-ouvertes.fr/hal-01579079
 

diff --git a/doc/source/ulong_extras.rst b/doc/source/ulong_extras.rst
@@ -192,8 +192,7 @@ Basic arithmetic with precomputed inverses
         invxl = (B^2 - B*x - 1)/x = (B^2 - 1)/x - B
 
     Note that `x` must be normalised, i.e. with msb set. This inverse
-    makes use of the following theorem of Torbjorn Granlund and Peter
-    Montgomery~[Lemma~8.1][GraMon1994]_:
+    makes use of Lemma 8.1 in [GraMon1994]_:
 
     Let `d` be normalised, `d < B`, i.e. it fits in a word, and suppose
     that `m d < B^2 \leq (m+1) d`. Let `0 \leq n \leq B d - 1`.  Write