> On 29 Sep 2020, at 19:17, Marco Bodrato wrote:
>
> Il 2020-09-29 16:09 TonyMcC ha scritto:
>> I think there is a word (a function name?) missing from the
>> documentation for gmp 6.2.0. In gmp.texi, at line 2541 it reads:
>> "it's probably best to call to get a starting point and iterate
Hi,
I think there is a word (a function name?) missing from the
documentation for gmp 6.2.0. In gmp.texi, at line 2541 it reads:
"it's probably best to call to get a starting point and iterate from there."
Should there be a function name after "call"?
Best wishes,
Tony
Ciao,
Il 2020-09-29 16:09 TonyMcC ha scritto:
I think there is a word (a function name?) missing from the
documentation for gmp 6.2.0. In gmp.texi, at line 2541 it reads:
"it's probably best to call to get a starting point and iterate from
there."
Should there be a function name after
Hi Tony,
> I think there is a word (a function name?) missing from the
> documentation for gmp 6.2.0. In gmp.texi, at line 2541 it reads:
>
> "it's probably best to call to get a starting point and iterate from there."
>
> Should there be a function name after "call"?
yes, I guess you
Hi,
On 2018-02-25 20:37:49 +0100, Stéphane Bosio wrote:
> the following can be read:
>
>-- Function: void mpz_rrandomb (mpz_t ROP, gmp_randstate_t STATE,
> mp_bitcnt_t N)
> Generate a random integer with long strings of zeros and ones in
> the binary
Hello,
I think there is an error in the following info section :
* Random Number Functions:: Functions for generating random numbers.
then
*note Integer Random Numbers::
the following can be read:
-- Function: void mpz_rrandomb (mpz_t ROP, gmp_randstate_t STATE,
reported to me by Bob Baillie (through Sam Wagstaff):
>Anyway, on page 111 of the manual (section 15.7.1, Prime Testing)
>https://gmplib.org/gmp-man-6.1.2.pdf
>where it describes the algorithm for mpz_probab_prime_p, it says,
>
>"For an odd input n, and with n = q*2^k + 1 where q is odd, this
