elblogo


The Goldbach Conjecture...

Goldbach's conjecture: Every even integer n greater than four is the sum of two primes.

Jump down to the goldbachapplet directly.

Here is the original problem (in German) as given in the course of Prof. Dr. Klaus Bothe. In short: Because there has still not been found any real proof for the Goldbach Conjecture, we had to proof this conjecture in a practical way for numbers up to 1000 with the help of the computer, by finding two primenumbers. In this applet I allowed to proof it up to 10.000, though above 1000 the time per proof increases dramatically. With modern hightechcomputers the conjecture was verified up to 4 x 1014, but of course that's still no real proof in the mathematical sense.

"Schreiben Sie ein Java-Programm, welches für n <= 1000 diese Vermutung praktisch durch Angabe je eines Paares von Primzahlen (p1, p2) mit n = p1 + p2 nachweist. Realisieren sie ihren Algorithmus so, dass jeweils ein minimales p1 ermittelt wird: falls es also mehrere Darstellungen von n als Primzahlsummen gibt, soll ihr Programm die mit dem kleinsten p1 (und damit zugleich dem größten p2) ausgeben."

And here you can find out more and some interesting links about this conjecture. There is one million dollar to earn!! ;-)


Here normally you find my GoldbachApplet...


Design and © 2006 by Martin Sommerfeld