# Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅1018

@article{Silva2014EmpiricalVO,
title={Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅1018},
author={Tom{\'a}s Oliveira e Silva and Siegfried Herzog and Silvio Pardi},
journal={Math. Comput.},
year={2014},
volume={83},
pages={2033-2060}
}
• Published 18 November 2013
• Computer Science, Mathematics
• Math. Comput.
This paper describes how the even Goldbach conjecture was confirmed to be true for all even numbers not larger than 4 · 1018. Using a result of Ramaré and Saouter, it follows that the odd Goldbach conjecture is true up to 8.37 · 1026. The empirical data collected during this extensive verification effort, namely, counts and first occurrences of so-called minimal Goldbach partitions with a given smallest prime and of gaps between consecutive primes with a given even gap, are used to test several… Expand
The ternary Goldbach problem
The ternary Goldbach conjecture, or three-primes problem, states that every odd number n greater than 5 can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolvedExpand
Definitive General Proof of Goldbach's conjecture
The Goldbach conjecture states that every even integer is the sum of two primes. This conjecture was proposed in 1742 and, despite being obviously true, has remained unproven. To prove thisExpand
Divisor Goldbach Conjecture and its Partition Number
• Mathematics
• 2016
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of someExpand
Refined Goldbach Conjectures with Primes in Progressions
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with oneExpand
A GENERALIZATION OF GOLDBACH ’ S CONJECTURE
• 2017
Goldbach’s conjecture states that every even number greater than 2 can be expressed as the sum of two primes. The aim of this paper is to propose a generalization – or a set of increasinglyExpand
Primes between consecutive powers
This paper updates two explicit estimates for primes between consecutive powers. We find at least one prime between n3 and (n+1)3 for all n ≥ exp(exp(32.9)), and at least one prime in (n296, (n +Expand
A Matricial Aspect of Goldbach’s Conjecture
This article is a survey based on our earlier paper (“The “Vertical” Generalization of the Binary Goldbach’s Conjecture as Applied on “Iterative” Primes with (Recursive) Prime Indexes (i-primeths)”Expand
Explicit results on primes
Let p be a prime number. In this thesis we prove the following theorems. Theorem -1.0.1. Let x0 ≥ 4·1018 be a fixed constant and let x > x0. Then there exists at least one prime p such that (1 −∆−1)xExpand
Goldbach for Gaussian, Hurwitz, Octavian and Eisenstein primes
• O. Knill
• Mathematics, Computer Science
• ArXiv
• 2016
Goldbach type questions for Gaussian, Hurwitz, Octavian and Eisenstein primes are formulated and some Hardy-Littlewood constants following early computations from Daniel Shanks and Marvin Wunderlich are looked at. Expand
Studies on Twin Primes in Goldbach Partitions of Even Numbers
Goldbach strong conjecture states that all even integers n>2 can be expressed as the sum of two prime numbers (Goldbach partitions of n). This work is devoted to studies on twin primes present inExpand