http://www.petrospec-technologies.com/Herkommer/goldbach.

htm

Goldbach Conjecture Research

by

Mark Herkommer May 24, 2004

The Conjecture...
This conjecture dates from 1742 and was discovered in correspondence between Goldbach and Euler. It falls under the general heading of partitioning problems in additive number theory. Goldbach made the conjecture that every odd number > 6 is equal to the sum of three primes. Euler replied that Goldbach's conjecture was equivalent to the statement that every even number > 4 is equal to the sum of two primes. Because proving the second implies the first, but not the converse, most attention has been focused on the second representation. The smallest numbers can be verified easily by hand:
6=3+3 14 = 3 + 11 22 = 3 + 19 30 = 7 + 23 38 = 7 + 31 46 = 3 + 43 8=3+5 16 = 3 + 13 24 = 5 + 19 32 = 3 + 29 40 = 3 + 37 48 = 5 + 43 10 = 3 + 7 18 = 5 + 13 26 = 3 + 23 34 = 3 + 31 42 = 5 + 37 50 = 3 + 47 12 = 5 + 7 20 = 3 + 17 28 = 5 + 23 36 = 5 + 31 44 = 3 + 41 52 = 5 + 47

Of course all the examples in the world do not a proof make.

Research On The Conjecture...

As a partitioning problem it is worth noting that as the numbers get larger the number of representations grows as well:
12 = 5 + 7 24 = 5 + 19 = 7 + 17 = 11 + 13 48 = 5 + 43 = 7 + 41 = 11 + 37 = 17 + 31 = 19 + 29

This would suggest that the likelihood of finding that exceptional even number that is not the sum of two primes diminishes as one searches in ever larger even numbers. Euler was convinced that Goldbach's conjecture was true but was unable to find any proof (Ore, 1948). The first conjecture has been proved for sufficiently large odd numbers by Hardy and Littlewood (1923) using an "asymptotic" proof. They proved that there exists an n0 such that every odd number n > n0 is the sum of three primes. In 1937 the Russian mathematician Vingradov (1937, 1954) again proved the first conjecture for a sufficiently large, (but indeterminate) odd numbers using analytic methods. Calculations of n0 suggest a value of 3^3^15, a number having 6,846,169 digits (Ribenboim, 1988, 1995a). In 1966 Chen Jing-Run (1966) proved that every sufficiently large even number can be expressed as the sum of a prime and a number with no more than two prime factors (reprinted in Chen, 1973, 1978). One can verify Goldbach's conjecture by brute force, up to a point. By using about 130 CPU-hours on an IBM 3083 Sinisalo (1993) verified the conjecture up to 4*10^11. Although Sinisalo used a bit array and Eratosthenes sieve, the QBASIC program that follows the similar strategy while employing trial division. The procedure is to take an odd number and then find small primes starting with 3, up to n/2. If p is prime then the difference n - p is tested for primality. If the difference is prime then we are done we have found a pair. The first pair found is the minimal Goldbach partition value. To use the program, copy the following program to your clipboard. Next, open a text editor like Notepad and paste it in. Save it with the filename GOLDBACH.BAS. Then run it using QBASIC.
Inikah penyelesaian Konjektur Goldbach
Konjektur Goldbach merupakan sebuah permasalahan matematika yang cukup memusingkan para ahli matematika. Konjektur Goldbach berbunyi: Setiap bilangan bulat genap yang lebih besar dari 2 dapat ditulis sebagai jumlah dari dua bilangan prima Contoh:

4=2+2 6=3+3 8=3+5 10 = 3 + 7 = 5 + 5 12 = 5 + 7 14 = 3 + 11 = 7 + 7 dst.

Salah satu teman saya menjawab dengan sifat pada bilangan genap yang bisa dinyatakan sebagai penjumlahan dari dua bilangan ganjil (hampir semua bilangan prima adalah ganjil), saya hanya sedikit menambahkan yaitu bilangan genap bisa dinyatakan sebagai penjumlahan dari dua bilangan genap dan ganjil. Anda bisa membuktikannya dengan aljabar sederhana tanpa harus mengetahui pola dari bilangan prima. Sederhana saja bukan.

Konjektur Goldbach
Dari Wikipedia bahasa Indonesia, ensiklopedia bebas

Belum Diperiksa

Konjenktur Goldbach adalah salah satu persoalan yang belum terpecahkan dalam teori angka dan bahkan dalam matematika secara keseluruhan. Konjektur Goldbach berbunyi:

Setiap bilangan bulat genap yang lebih besar dari 2 dapat ditulis sebagai jumlah dari dua bilangan prima

Contoh: 4=2+2 6=3+3 8=3+5 10 = 3 + 7 = 5 + 5 12 = 5 + 7 14 = 3 + 11 = 7 + 7 16 = 13 + 3 18 = 13 + 5 = 11 + 7 20 = 17 + 3 = 13 + 7

22 = 19 + 3 = 17 + 5 = 11 + 11 yang ganjil harus dipikirkan dst. [sunting]Sejarah Konjektur Goldbach pertama kali disebut oleh Christian Goldbach dalam suratnya kepada Euler pada tahun 1742. Dalam suratnya, Goldbach melaporkan bahwa bilangan genap lebih dari atau sama dengan 4 bisa ditulis sebagai hasil penjumlahan dua buah bilangan prima, akan tetapi dia tidak berhasil membuktikan kebenaran daripada konjekturnya tersebut.

Goldbach's conjecture
From Wikipedia, the free encyclopedia

Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states: Every even integer greater than 2 can be expressed as the sum of two primes.[1]

The number of ways an even number can be represented as the sum of two primes[2]

A Goldbach number is a number that can be expressed as the sum of two odd primes. Therefore, another statement of Goldbach's conjecture is that all even integers greater than 4 are Goldbach numbers. The expression of a given even number as a sum of two primes is called a Goldbach partition of the number. For example, 4=2+2 6=3+3 8=3+5 10 = 7 + 3 or 5 + 5 12 = 5 + 7 14 = 3 + 11 or 7 + 7
Contents
[hide]

1 Origins 2 Verified results 3 Heuristic justification 4 Rigorous results

5 Similar conjectures 6 In popular culture 7 References 8 Further reading 9 External links

[edit]Origins On 7 June 1742, the German mathematician Christian Goldbach (originally of Brandenburg-Prussia) wrote a letter to Leonhard Euler (letter XLIII)[3] in which he proposed the following conjecture: Every integer which can be written as the sum of two primes, can also be written as the sum of as many primes as one wishes, until all terms are units. He then proposed a second conjecture in the margin of his letter: Every integer greater than 2 can be written as the sum of three primes. He considered 1 to be a prime number, a convention subsequently abandoned.[4] The two conjectures are now known to be equivalent, but this did not seem to be an issue at the time. A modern version of Goldbach's marginal conjecture is: Every integer greater than 5 can be written as the sum of three primes. Euler replied in a letter dated 30 June 1742, and reminded Goldbach of an earlier conversation they had ("...so Ew vormals mit mir communicirt haben.."), in which Goldbach remarked his original (and not marginal) conjecture followed from the following statement Every even integer greater than 2 can be written as the sum of two primes, which is thus also a conjecture of Goldbach. In the letter dated 30 June 1742, Euler stated: Dass ... ein jeder numerus par eine summa duorum primorum sey, halte ich fr ein ganz gewisses theorema, ungeachtet ich dasselbe necht demonstriren kann. ("every

even integer is a sum of two primes. I regard this as a completely certain theorem, although I cannot prove it.")[5][6] Goldbach's third version (equivalent to the two other versions) is the form in which the conjecture is usually expressed today. It is also known as the "strong", "even", or "binary" Goldbach conjecture, to distinguish it from a weaker corollary. The strong Goldbach conjecture implies the conjecture that all odd numbers greater than 7 are the sum of three odd primes, which is known today variously as the "weak" Goldbach conjecture, the "odd" Goldbach conjecture, or the "ternary" Goldbach conjecture. Both questions have remained unsolved ever since, although the weak form of the conjecture appears to be much closer to resolution than the strong one. If the strong Goldbach conjecture is true, the weak Goldbach conjecture will be true by implication.[6] [edit]Verified

results

For small values of n, the strong Goldbach conjecture (and hence the weak Goldbach conjecture) can be verified directly. For instance, Nils Pipping in 1938 laboriously verified the conjecture up to n 105.[7] With the advent of computers, many more small values of n have been checked; T. Oliveira e Silva is running a distributed computer search that has verified the conjecture for n 1.609 1018 and some higher small ranges up to 4 1018 (double-checked up to 1 1017).[8]