about prime number generation

[Christian Calderon]

Sorry I accidentally emailed this response to Enrique alone, resending it
to the list.

I ran a script to test this. It uses a sieve of eratosthenes and generates
a list of all primes less than 0xFFFFFFFF (i.e. 2**32 - 1), and calls
nextprime to see if the result is equal to the next prime in the list. It
passed for every prime in the list, nextprime(p[i]) == p[i+1].

~ Christian Calderon


On Sat, Apr 30, 2022 at 6:19 AM Garcia Moreno-Esteva, Enrique <
enrique.garciamoreno-esteva at helsinki.fi> wrote:

> Hello,
>
> I apologize this is not a comment about your webpage, but more a question
> about your library. Would your library contain a function (call it p(n) )
> that generates the n-th prime? If it does not, alternatively, do you have a
> lower bound for  certifiably producing the next prime with the nextprime
> function in your library (it is probabilistic, but such probabilistic
> methods are deterministic below certain bounds, so my question is, what is
> the lower bound for your function)?
>
> I thank you in advance for your help.
>
> Enrique Garcia Moreno-Esteva
>
> _______________________________________________
> gmp-discuss mailing list
> gmp-discuss at gmplib.org
> https://gmplib.org/mailman/listinfo/gmp-discuss
>