![]() |
![]() |
#1 |
"Matthew Anderson"
Dec 2010
Oregon, USA
23·149 Posts |
![]()
Hi Mersenneforum,
As far as I know, the Goldbach conjecture is still a conjecture. In other words, unproven. It is an observation. Every even integer 2*n bigger than 6 is the sum of 2 odd prime numbers. grinz See attachment. Also, see oeis.org/A002372 Regards, Matt |
![]() |
![]() |
![]() |
#2 |
"Matthew Anderson"
Dec 2010
Oregon, USA
23×149 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
"Matthew Anderson"
Dec 2010
Oregon, USA
4A816 Posts |
![]()
Hi again Mersenneforum,
I rewrote the Maple code at home, a little cleaner than I did in the office. For you viewing pleasure. For what its worth. Matt ![]() |
![]() |
![]() |
![]() |
#4 |
"Matthew Anderson"
Dec 2010
Oregon, USA
4A816 Posts |
![]()
Hi Mersenneforum ,,
We can now view a graph with this Goldbach procedure. It is a good exercise, says me. Regards, Matt |
![]() |
![]() |
![]() |
#5 |
"Matthew Anderson"
Dec 2010
Oregon, USA
23·149 Posts |
![]()
Hi again all
Some are acquainted with Goldbach Conjecture It simply states that every even number greater than two can be represented as the sum of two prime numbers. Since the advent of computers, someone else did a computer simulation of at least the first one million numbers. The graph of Goldbach's Comet can be seen on today's Wikipedia page Goldbach Regards Matt ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Factorial and Goldbach conjecture. | MisterBitcoin | MisterBitcoin | 17 | 2018-01-29 00:50 |
Goldbach's weak conjecture | MattcAnderson | MattcAnderson | 19 | 2017-03-21 18:17 |
Goldbach's Conjecture | Patrick123 | Miscellaneous Math | 242 | 2011-03-15 14:28 |
Goldbach's conjecture | Citrix | Puzzles | 3 | 2005-09-09 13:58 |