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

Re: [PrimeNumbers] Weak Prime Number Conjecture

Expand Messages
  • Maximilian Hasler
    see http://oeis.org/search?q=1%2C3%2C25%2C49%2C7381 and http://en.wikipedia.org/wiki/Wolstenholme%27s_theorem Maximilian ... [Non-text portions of this message
    Message 1 of 2 , Apr 25, 2012
    • 0 Attachment
      see http://oeis.org/search?q=1%2C3%2C25%2C49%2C7381
      and http://en.wikipedia.org/wiki/Wolstenholme%27s_theorem

      Maximilian



      On Wed, Apr 11, 2012 at 1:33 PM, kadickv <kadickv@...> wrote:

      > **
      >
      >
      > Please comment the following conjecture weather it's obvious or already
      > known or new one
      >
      > Let 'N' be any odd number greater than 1
      >
      > Calculate a/b = summation(1/m) such that m = 1,2,3... (N-1) and gcd(a, b)
      > = 1.
      >
      > If a = 0(mod N) then 'N' is prime.
      >
      >
      >


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