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

Re: [PrimeNumbers] One for those hunting for covering sets

Expand Messages
  • Thomas Hadley
    ... I never heard an answer for this, but I think it is: -25 Or, actually, 2-p^p for p any odd prime. Tom Hadley [Non-text portions of this message have been
    Message 1 of 3 , Nov 20, 2006
      Phil wrote on 11/12/2006 04:10:28 AM:

      > Find an n such that for odd prime p, p^p+n is prime only
      > for one value of p.
      >
      > Phil
      >

      I never heard an answer for this, but I think it is: -25
      Or, actually, 2-p^p for p any odd prime.

      Tom Hadley


      [Non-text portions of this message have been removed]
    Your message has been successfully submitted and would be delivered to recipients shortly.