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

Re: [PrimeNumbers] Prime question

Expand Messages
  • Bouk de
    If your conjecture were true we wouldn t have any Mersenne primes. Bouk. ... __________________________________________________ Do You Yahoo!? Get personalized
    Message 1 of 62 , May 30, 2001
    • 0 Attachment
      If your conjecture were true we wouldn't have any
      Mersenne primes.

      Bouk.

      >
      > I have 'good reason to believe' that
      > 2^n - 1 = n*p for some integer n, p a prime.
      >
      > n is odd, "I know that, I know that.."
      >
      > Can you prove me wrong, right!
      >
      > regards
      > Paul Mills
      > Keniworth,
      > England.
      >

      __________________________________________________
      Do You Yahoo!?
      Get personalized email addresses from Yahoo! Mail - only $35
      a year! http://personal.mail.yahoo.com/
    • Jud McCranie
      ... No it doesn t, it fails for: # terms sum 21 715 22 793 24 965 27 1267 30 1595 etc.
      Message 62 of 62 , Jun 22, 2004
      • 0 Attachment
        At 06:21 PM 6/22/2004, edmorrey wrote:
        >I have found that the sum of all the prime number to a number plus 2
        >or 3 alternating gives a prime number
        >
        >for example:
        >
        >2 +3 = 5
        >2+3 +2 = 7
        >2+3+5 +3 = 13
        >2+3+5+7 +2 = 19
        >2+3+5+7+11 + 3 = 31
        >2+3+5+7+11+13 +2 = 43
        >ect.
        >
        >I will like to know if this is thruth in all the cases

        No it doesn't, it fails for:

        # terms sum
        21 715
        22 793
        24 965
        27 1267
        30 1595
        etc.
      Your message has been successfully submitted and would be delivered to recipients shortly.