Re: Unified test for Sophie Germain primes
>--- In firstname.lastname@example.org, "djbroadhurst" <d.broadhurst@...> wrote:Unnecessary but at least correct.
> It's not well known because it's quite unnecessary.
>This is closed to Henri Lifchitz's test 3^p = 1 (mod q) but your's also handles p=2 and p=3.
> If p is prime, then q = 2*p+1 is prime iff 4^p = 1 mod q.
>"There Is More Than One Way To Do It."
> Entia non sunt multiplicanda praeter necessitatem :-)
However, some ways are more efficient than others ;-)