[seqfan] Re: Software for searching for Wolstenholme primes?

David Wilson davidwwilson at comcast.net
Sun Nov 18 17:09:02 CET 2012


My guess would be probably not.

If there were an efficient way to evaluate binomial coefficient 
residues, then would be an efficient way to evaluate factorial (I 
think), and we would all be using Wilson's theorem an efficient 
deterministic primality test.

On 11/17/2012 5:02 AM, Georgi Guninski wrote:
> Out of blind opportunism I am looking for efficient software for
> verifying if a prime is a  Wolstenholme prime A088164.
>
> The basic definition requires computing a binomial coefficient
> mod p^4.
>
> For this task found Max Alekseyev's pari binomod.gp, but it appears
> slow to me: for p=2124679 binomod took 6 seconds.
>
> Is there efficient software or references for searching
> for Wolstenholme primes?
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>



More information about the SeqFan mailing list