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

[Max Alekseyev]

Along these lines, there is a nice blog post of Dick Lipton about the
relation between integer factorization and computation of factorials:
https://rjlipton.wordpress.com/2009/02/23/factoring-and-factorials/

On Wed, Sep 30, 2015 at 1:35 PM, <israel at math.ubc.ca> wrote:

> It is wrong. If n is composite and not equal to 4, then (n-1)! == 0 (mod
> n). So computing (n-1)! (mod n) would indeed be a deterministic primality
> test.
>
> Cheers,
> Robert Israel
>
> On Sep 29 2015, Georgi Guninski wrote:
>
>
> I don't this gives deterministic primality test,
>> since if $p$ is composite the algorithm will return
>> "random" results AFAICT.
>>
>> Would be glad if this claim is wrong :)
>>
>
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>