Checking the Goldbach conjecture on a vector computer:

"The Goldbach conjecture says that every even number can be expressed as the sum of two primes and it is known to be true up to 10⁸ (except for 2, if 1 is not considered a prime). This paper describes the results of a numerical verification of the Goldbach conjecture on a Cyber 205 vector compu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Granville, A. (VerfasserIn), Lune, J. van (VerfasserIn), Riele, Herman J. te (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1988
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM 1988,12
Schlagworte:
Zusammenfassung:"The Goldbach conjecture says that every even number can be expressed as the sum of two primes and it is known to be true up to 10⁸ (except for 2, if 1 is not considered a prime). This paper describes the results of a numerical verification of the Goldbach conjecture on a Cyber 205 vector computer up to the bound 2*10¹⁰. Some statistics and supporting results based on the Prime k-tuplets conjecture of Hardy and Littlewood are presented."
Beschreibung:11 S.