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

Re:Goldbach Lemma

Expand Messages
  • Eric Anderson
    Are you saying that any primorial can be proven true for Goldbach? For any p# it can be shown that [{(p1-1)(p2-1)(p3-1)....}/2]-1 is the number of ways that a
    Message 1 of 1 , Oct 31, 2002
    • 0 Attachment
      Are you saying that any primorial can be proven true for Goldbach?

      For any p# it can be shown that [{(p1-1)(p2-1)(p3-1)....}/2]-1 is the number

      of ways that a primorial can be expressed as the sum of two numbers

      without using any prime in the primorial.For example 2310

      can be expressed (2*4*6*10/2)-1=239 ways without using any number

      a factor less than 13.210 is (2*4*6/2)-1 or 23 "solutions".

      If you are correct this would be major imo.

      Eric



      ---------------------------------
      Do you Yahoo!?
      HotJobs - Search new jobs daily now

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