Related papers: Verification of Gilbraith's conjecture up to 10$^{…

A well-known conjecture of Gilbreath, and independently Proth from the 1800s, states that if $a_{0,n} = p_n$ denotes the $n^{\text{th}}$ prime number and $a_{i,n} = |a_{i-1,n}-a_{i-1,n+1}|$ for $i, n \ge 1$, then $a_{i,1} = 1$ for all $i…

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

In this paper two conjectures are proposed based on which we can prove the first case of Fermat's Last Theorem(FLT) for all primes $p \equiv -1 (\bmod~6)$. With Pollaczek's result {\bf [1]} and the conjectures the first case of FLT can be…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

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 unsolved until now, in spite of great progress in…

In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…

If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

The ternary Goldbach conjecture (or three-prime conjecture) states that every odd number greater than 5 can be written as the sum of three primes. The purpose of this book is to give the first proof of the conjecture, in full.

We compute all primes up to $6.25\times 10^{28}$ of the form $m^2+1$. Calculations using this list verify, up to our bound, a less famous conjecture of Goldbach. We introduce `Goldbach champions' as part of the verification process and…

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

In this paper we prove that the binary Goldbach conjecture for sufficiently large even integers would follow under the assumption that both the Elliott-Halberstam conjecture and a variant of the Elliott-Halberstam conjecture twisted by the…

We answer the question positively. In fact, we believe to have proved that every even integer $2N\geq3\times10^{6}$ is the sum of two odd distinct primes. Numerical calculations extend this result for $2N$ in the range $8-3\times10^{6}$.…

In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…