Goldbach's Conjecture

[science_man_88]

Originally Posted by science_man_88

Okay good information. If n is half c then it becomes c-n(the n in my equation) which should come to the top of the 2 possible primes in my equations(according to your code).

I'm all messed up actually half c will make it 5.c-n which is the lower of the 2 primes and the p value in 2n-p should be the higher I think.

[3.14159]

No. The potential counterexample to Goldbach's conjecture is a number n such that for p = 3, 5, 7, 11, ..., precprime(n), 2n - p is composite. We don't think there is such a number, but parity considerations don't rule it out.

A lame joke: Keep looking, buddy. You'll never find one.

[science_man_88]

Originally Posted by 3.14159

A lame joke: Keep looking, buddy. You'll never find one.

314159 you can't talk you haven't got me messed up a bit trying to disprove you and I'm the dumbest person on here lol.

[science_man_88]

gettime();forstep(n=4,4000,[2],forprime(x=2,.5*n,if(isprime(floor((.5*n-x)+(.5*n))),print1(n",");break())));gettime() latest code finds the first example then goes on I tried this once and got 203 ms (and I'm on an old machine time wise).

edit: and i forgot to allocatemem() more than the start value lol

allocated max memory allowed 932249567 and trying to 4000000 tested over 1 minute and finished about 59386 checks

[science_man_88]

1001018 is where it stopped as I don't have enough precomputed primes. and I can find them but if i close I lose them i don't know how to get them on the precomputed primes list.

test took about 10 minutes.

[CRGreathouse]

Originally Posted by science_man_88

1001018 is where it stopped as I don't have enough precomputed primes. and I can find them but if i close I lose them i don't know how to get them on the precomputed primes list.

Edit your .gprc file to use a higher number on startup. I use

  primelimit = 500M

but your choice should depend on your computer's memory and speed as well as your patience.

Of course you don't really need many precomputed primes for this task...

[3.14159]

314159 you can't talk you haven't got me messed up a bit trying to disprove you and I'm the dumbest person on here lol.

Okay: I want you to express the integer 690487410473298653431 as 53318149a + 14651927b.

[3.14159]

Edit your .gprc file to use a higher number on startup. I use primelimit = 500M

No such setting exists here.

[science_man_88]

Originally Posted by CRGreathouse

Edit your .gprc file to use a higher number on startup. I use

  primelimit = 500M

but your choice should depend on your computer's memory and speed as well as your patience.

I don't know where the gprc file is and my details are 4 gb ram 2.8 ghz and a really old obsolete 32 bit cpu lol.

[3.14159]

I don't know where the gprc file is and my details are 4 gb ram 2.8 ghz and a really old obsolete 32 bit cpu lol.

Open PARI's file location. The file should be there.

P.S: 690487410473298653431 = 53318149a + 14651927b. a = ?; b = ?

[science_man_88]

Originally Posted by 3.14159

Open PARI's file location. The file should be there.

P.S: 690487410473298653431 = 53318149a + 14651927b. a = ?; b = ?

found the file can't find the part to change primelimit

oh and by the way I checked the resulting list against how many , there should be seems to have one missing.

doh I know why forgot 2 wasn't included lol