Typo fix in manpage
Martin Kelly
8 months ago
| 0 | From: Martin Kelly <martin@martingkelly.com> | |
| 1 | Date: Sat, 19 Aug 2023 14:26:11 -0700 | |
| 2 | Subject: typo fix in manpage | |
| 3 | ||
| 4 | --- | |
| 5 | docs/mpz.rst | 22 +++++++++++----------- | |
| 6 | 1 file changed, 11 insertions(+), 11 deletions(-) | |
| 7 | ||
| 8 | diff --git a/docs/mpz.rst b/docs/mpz.rst | |
| 9 | index 4171b3a..7c21c60 100644 | |
| 10 | --- a/docs/mpz.rst | |
| 11 | +++ b/docs/mpz.rst | |
| 12 | @@ -103,7 +103,7 @@ mpz Methods | |
| 13 | x.is_prime() returns True if *x* is _probably_ prime, else False if *x* is | |
| 14 | definitely composite. | |
| 15 | ||
| 16 | - See the documentation for *gmpy2.is_prime* for details on the underlaying | |
| 17 | + See the documentation for *gmpy2.is_prime* for details on the underlying | |
| 18 | primality tests that are performed. | |
| 19 | ||
| 20 | **is_square(...)** | |
| 21 | @@ -135,7 +135,7 @@ mpz Functions | |
| 22 | bit_clear(x, n) returns a copy of *x* with bit *n* set to 0. | |
| 23 | ||
| 24 | **bit_count(...)** | |
| 25 | - bit_count(x) returns a the number of 1 bits in the binary | |
| 26 | + bit_count(x) returns a the number of 1 bits in the binary | |
| 27 | representation of *x*. Differs from popcount() for x <0. | |
| 28 | ||
| 29 | **bit_flip(...)** | |
| 30 | @@ -285,11 +285,11 @@ mpz Functions | |
| 31 | ||
| 32 | **is_bpsw_prp(...)** | |
| 33 | is_bpsw_prp(n) returns True if *n* is a Baillie-Pomerance-Selfridge-Wagstaff | |
| 34 | - probable prime. A BPSW probable prime passes both the is_strong_prp() test | |
| 35 | + probable prime. A BPSW probable prime passes both the is_strong_prp() test | |
| 36 | with base 2 and the is_selfridge_prp() test. | |
| 37 | ||
| 38 | **is_congruent(...)** | |
| 39 | - is_congurent(x, y, m) returns True if *x* is congruent to *y* modulo *m*, | |
| 40 | + is_congurent(x, y, m) returns True if *x* is congruent to *y* modulo *m*, | |
| 41 | else return False. | |
| 42 | ||
| 43 | **is_divisible(...)** | |
| 44 | @@ -310,8 +310,8 @@ mpz Functions | |
| 45 | ||
| 46 | **is_extra_strong_lucas_prp(...)** | |
| 47 | is_extra_strong_lucas_prp(n, p) returns True if n is an extra strong Lucas probable | |
| 48 | - prime with parameters (p, 1). | |
| 49 | - | |
| 50 | + prime with parameters (p, 1). | |
| 51 | + | |
| 52 | Assuming: | |
| 53 | n is odd | |
| 54 | D = p*p - 4 | |
| 55 | @@ -347,7 +347,7 @@ mpz Functions | |
| 56 | lucasv(p,q,n) == p (mod n). | |
| 57 | ||
| 58 | **is_lucas_prp(...)** | |
| 59 | - is_lucas_prp(n,p,q) returns True if *n* is a Lucas probable prime with | |
| 60 | + is_lucas_prp(n,p,q) returns True if *n* is a Lucas probable prime with | |
| 61 | parameters (p,q). | |
| 62 | ||
| 63 | Assuming: | |
| 64 | @@ -518,15 +518,15 @@ mpz Functions | |
| 65 | ||
| 66 | **powmod_exp_list(...)** | |
| 67 | powmod_exp_list(base, exp_lst, mod) returns list(powmod(base, i, mod) for i in exp_lst). | |
| 68 | - Releases the GIL so can be easily run in multiple threads. | |
| 69 | - | |
| 70 | + Releases the GIL so can be easily run in multiple threads. | |
| 71 | + | |
| 72 | Experimental in gmpy2 2.1.x. The capability will continue to exist in future | |
| 73 | versions but the name may change. | |
| 74 | ||
| 75 | **powmod_base_list(...)** | |
| 76 | powmod_base_list(base_list, exp, mod) returns list(powmod(i, exp, mod) for i in lst). | |
| 77 | - Releases the GIL so can be easily run in multiple threads. | |
| 78 | - | |
| 79 | + Releases the GIL so can be easily run in multiple threads. | |
| 80 | + | |
| 81 | Experimental in gmpy2 2.1.x. The capability will continue to exist in future | |
| 82 | versions but the name may change. | |
| 83 |