Loading ...
Sorry, an error occurred while loading the content.

Re: Unified test for Sophie Germain primes

Expand Messages
  • j_chrtn
    ... Unnecessary but at least correct. ... This is closed to Henri Lifchitz s test 3^p = 1 (mod q) but your s also handles p=2 and p=3. ... There Is More Than
    Message 1 of 5 , Jan 20, 2010
    • 0 Attachment
      >--- In primenumbers@yahoogroups.com, "djbroadhurst" <d.broadhurst@...> wrote:
      >
      >
      > It's not well known because it's quite unnecessary.
      >
      Unnecessary but at least correct.

      >
      > If p is prime, then q = 2*p+1 is prime iff 4^p = 1 mod q.
      >
      This is closed to Henri Lifchitz's test 3^p = 1 (mod q) but your's also handles p=2 and p=3.

      >
      > Entia non sunt multiplicanda praeter necessitatem :-)
      >

      "There Is More Than One Way To Do It."
      http://en.wikipedia.org/wiki/There's_more_than_one_way_to_do_it

      However, some ways are more efficient than others ;-)

      Regards,
      J-L
    Your message has been successfully submitted and would be delivered to recipients shortly.