New poproject???

JohnFullspeed · 2011-08-22, 15:43

One of th oldest conjecture is a prime conjecture of GOLDBACH
All even number > 6 can be write like the sum of two prime 12=7+5 18=11+7 ....
This conjecture has been verify until 1^20 (to confirm)
It' easy to distrib the job by range like twin or other
The code is very essay to write The pb is the number pb is the number of even number....
The code could be wtite also in PARI or other. Using Maithematica,GNU or other environment
Searcher can find speeder method than the basic way
(I don't know where to propose the project so I choose Prime Search Project (sorry for this forum!)
John

10metreh · 2011-08-22, 17:39

This project would be completely pointless. Goldbach's conjecture is almost certainly true: this graph shows the number of ways the even numbers up to 1000000 can be represented as the sum of two primes. Note the absence of any lone even numbers with a surprisingly small number of representations. The prime number theorem can also be used to show that Goldbach's conjecture is probably true. Thus the project would not find anything and people would just be wasting their CPU time. Also, the project would not break any significant records; it would also not pioneer or encourage the invention of new algorithms.

JohnFullspeed · 2011-08-22, 18:41

No record like RSA 768,o new algo like twin search, no new theory like factoring just peaple working together on an unseful project like all primes.Just the human knowledge

Bur that find twin with 1000 digit with an Neanderthal method is interesting!
Sorry
But perhaps the conjectire is older than the USA
John

ATH · 2011-08-22, 23:10

There is an ongoing verification: http://www.ieeta.pt/~tos/goldbach.html

They reached 22*10¹⁷ on May 24, 2011 and they are also recording prime gaps: http://www.ieeta.pt/~tos/gaps.html

LaurV · 2011-08-23, 02:27

I always had the feeling that this conjecture is already proved..

CRGreathouse · 2011-08-23, 02:32

Quote:

Originally Posted by LaurV

I always had the feeling that this conjecture is already proved..

The weak version nearly is. The strong version... I'd be surprised if that was proved in the next 20 years. (Not shocked, like if the RH was, but surprised.)

JohnFullspeed · 2011-08-23, 05:36

Quote:

Originally Posted by ATH

There is an ongoing verification: http://www.ieeta.pt/~tos/goldbach.html

They reached 22*10¹⁷ on May 24, 2011 and they are also recording prime gaps: http://www.ieeta.pt/~tos/gaps.html

Is''t an answer not a dictate
Thanks

JohnFullspeed · 2011-08-23, 05:46

Quote:

Originally Posted by ATH

There is an ongoing verification: http://www.ieeta.pt/~tos/goldbach.html

They reached 22*10¹⁷ on May 24, 2011 and they are also recording prime gaps: http://www.ieeta.pt/~tos/gaps.html

Is''t an answer not a dictate
Thanks

Quote:

The Goldbach conjecture is one of the oldest unsolved problems in number theory [1, problem C1]. In its modern form, it states that every even number larger than two can be expressed as a sum of two prime numbers.

Probably bad scientists...

CRGreathouse · 2011-08-23, 07:18

Quote:

Originally Posted by JohnFullspeed

Is''t an answer not a dictate

What does this mean? (En français, si nécessaire.)

JohnFullspeed · 2011-08-23, 10:03

Votr reponnse est une vraie reponse: vous donner des elements qui font avanver le debat aors que la reponse precedente ressemnblait fort a une decision unilaterale sans consulter mes aitres et sans fondements tecnniques
Thanks to you
John

2011-08-22, 15:43	#1
JohnFullspeed May 2011 France 7·23 Posts	New poproject??? One of th oldest conjecture is a prime conjecture of GOLDBACH All even number > 6 can be write like the sum of two prime 12=7+5 18=11+7 .... This conjecture has been verify until 1^20 (to confirm) It' easy to distrib the job by range like twin or other The code is very essay to write The pb is the number pb is the number of even number.... The code could be wtite also in PARI or other. Using Maithematica,GNU or other environment Searcher can find speeder method than the basic way (I don't know where to propose the project so I choose Prime Search Project (sorry for this forum!) John

2011-08-22, 17:39	#2
10metreh Nov 2008 2·3³·43 Posts	This project would be completely pointless. Goldbach's conjecture is almost certainly true: this graph shows the number of ways the even numbers up to 1000000 can be represented as the sum of two primes. Note the absence of any lone even numbers with a surprisingly small number of representations. The prime number theorem can also be used to show that Goldbach's conjecture is probably true. Thus the project would not find anything and people would just be wasting their CPU time. Also, the project would not break any significant records; it would also not pioneer or encourage the invention of new algorithms. Last fiddled with by 10metreh on 2011-08-22 at 17:41

2011-08-22, 18:41	#3
JohnFullspeed May 2011 France 7·23 Posts	Sorry No record like RSA 768,o new algo like twin search, no new theory like factoring just peaple working together on an unseful project like all primes.Just the human knowledge Bur that find twin with 1000 digit with an Neanderthal method is interesting! Sorry But perhaps the conjectire is older than the USA John

2011-08-23, 10:03	#10
JohnFullspeed May 2011 France 7·23 Posts	Translation Votr reponnse est une vraie reponse: vous donner des elements qui font avanver le debat aors que la reponse precedente ressemnblait fort a une decision unilaterale sans consulter mes aitres et sans fondements tecnniques Thanks to you John

2011-08-22, 23:10	#4
ATH Einyen Dec 2003 Denmark 3,037 Posts	There is an ongoing verification: http://www.ieeta.pt/~tos/goldbach.html They reached 22*10¹⁷ on May 24, 2011 and they are also recording prime gaps: http://www.ieeta.pt/~tos/gaps.html

2011-08-23, 02:27	#5
LaurV Romulan Interpreter Jun 2011 Thailand 5²·7·53 Posts	I always had the feeling that this conjecture is already proved..