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

Goldbach Pair Selection

Expand Messages
  • William Bouris
    Is it possible to prove or disprove that when given an even number, say N, that the first prime which describes a Goldbach pair that totals N may be p1
    Message 1 of 2 , Oct 2, 2003
      Is it possible to prove or disprove that when given an even number, say N, that the first prime which describes a Goldbach pair that totals "N" may be p1 <= INT(2*SQRT(N))?

      Bill


      ---------------------------------
      Do you Yahoo!?
      The New Yahoo! Shopping - with improved product search

      [Non-text portions of this message have been removed]
    • jbrennen
      ... Disprove: N=992. P1=73. P1 INT(2*SQRT(N)).
      Message 2 of 2 , Oct 2, 2003
        --- William Bouris wrote:
        > Is it possible to prove or disprove that when given an
        > even number, say N, that the first prime which describes
        > a Goldbach pair that totals "N" may be p1 <= INT(2*SQRT(N))?

        Disprove:

        N=992. P1=73. P1 > INT(2*SQRT(N)).
      Your message has been successfully submitted and would be delivered to recipients shortly.