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

A test program for the trial of solving Goldbach's conjecture.

Expand Messages
  • zaljohar
    This program is a rough test for the solution of Goldbach s conjecture presented in the message titled: final corrected version of trying solving goldbach s
    Message 1 of 1 , Jan 9, 2005
    • 0 Attachment
      This program is a rough test for the solution of Goldbach's
      conjecture presented in the message titled: final corrected version
      of trying solving goldbach's conjecture.


      5 INPUT s
      t = 0

      FOR y = 2 TO s STEP 2
      w = 0

      10 FOR n = 2 TO y / 2

      30 FOR i = 1 TO 37


      40 READ p


      50 IF n = p THEN 85
      60 IF (n / p) = INT(n / p) THEN 100
      70 IF n <= p ^ 2 THEN 85

      80 NEXT i
      85 GOSUB 132
      90 DATA 2,3,5,7,
      11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,
      103,107,109,113,127,131,137,139,149,151,157
      100 RESTORE 90

      130 NEXT n
      131 GOTO 415
      132 IF n = y / 2 THEN 740
      RESTORE 90
      133 LET m = y - n


      135 FOR j = 1 TO 37
      140 READ q
      150 IF m = q THEN 185
      160 IF (m / q) = INT(m / q) THEN 200
      170 IF m <= q ^ 2 THEN 185

      180 NEXT j
      185 w = w + 1


      200 RESTORE 90
      220 RETURN
      415 RESTORE 90
      FOR b = 1 TO 37
      READ u
      IF y <= u ^ 2 THEN 425
      NEXT b
      425 g = INT(((y / 2) - (u - 1)) / 2)
      427 RESTORE 90
      430 FOR k = 1 TO 37
      440 READ l
      443 IF l = 2 THEN 480
      445 IF y >= l ^ 2 THEN 450
      447 GOTO 705
      450 v = INT(g / l) * (l - 2)
      455 r = g - (INT(g / l) * l)

      460 IF r > 1 THEN 470
      465 F = 0
      467 GOTO 473
      470 F = r - 2
      473 g = v + F

      480 NEXT k
      705 h = w
      720 d = h - g

      723 : IF d > -1 THEN 739
      725 : PRINT y; ":"; "H="; h; "g="; g; ":"; d
      727 : PRINT "GOLDBACH CONJCTURE PROOF IS WRONG"
      730 : t = t + 1
      738 : GOTO 740
      739 PRINT y; h; g; d
      740 RESTORE 90
      745 NEXT y

      750 : IF t <> 0 THEN 770
      760 : PRINT "GOLDBACH CONJECTURE PROOF IS RIGHT"
      GOTO 780
      770 : PRINT "GOLDBACH CONJCTURE PROOF IS WRONG"
      PRINT t
      780 IF s <> 0 THEN 5
      775 END

      The program is writtin in Q BASIC .

      u represent Pk,PL1_1.

      If it is possible please report at which number the proof would be
      wrong , I'v tested it up to y=13000 , the proof is still right!.I
      will appreciate any comment or help in forming a more effective
      program to test the solution presented in earlier messages
      "the slideability method".

      Zuhair
    Your message has been successfully submitted and would be delivered to recipients shortly.