Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial $F_N$ is divisible by the $N$th cyclotomic polynomial if and only if there is no representation of $N$ as the sum of two odd primes. The coefficients of these polynomials stabilize, as $N$ grows, to a fixed sequence $a(m)$; they derived upper and lower bounds for $a(m)$, and an asymptotic formula for the summatory function $A(M)$ of the sequence, both under the assumption of a famous conjecture of Hardy and Littlewood. In this article we improve these results: we obtain an asymptotic formula for $a(m)$ under the same assumption, and we establish the asymptotic formula for $A(M)$ unconditionally.
Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.
The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or strong, Goldbach conjecture had their origin in an exchange of letters between Euler and Goldbach in 1742. We will follow an approach based on the circle method, the large sieve and exponential sums. Some ideas coming from Hardy, Littlewood and Vinogradov are reinterpreted from a modern perspective. While all work here has to be explicit, the focus is on qualita…
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 determine very thin and low diverging ranges in which the probability of finding a prime is one.
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 Möbius function hold, in which the sum of their levels of distribution exceeds 1. This continues the work of Pan in 1982. An analogous result for the twin prime conjecture is obtained by Ram Murty and Vatwani in 2017.
We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient condition for the truth of the Goldbach conjecture, the infinitude of prime twins, and more general of prime pairs with a fixed even difference.
We examine the problem of writing every sufficiently large even number as the sum of two primes and at most $K$ powers of 2. We outline an approach that only just falls short of improving the current bounds on $K$. Finally, we improve the estimates in other Waring--Goldbach problems.
For every even integer N, denote by D_{1,2}(N) the number of representations of N as a sum of a prime and an integer having at most two prime factors. In this paper, we give a new lower bound for D_{1,2}(N).
We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the conjecture, it does suggest two natural generalizations for which we provide some numerical evidence. As these polynomials $F_N$ are independently interesting, we further explore their basic properties, giving, among other things, asymptotic estimates on the growth of their coefficients.
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 similar to the prime numbers is negligible. This result makes it possible to generalize the conjecture to any subset of natural numbers whose distribution is similar to the prime numbers. Additionally, we selected several new subsets whose distribution amongst the natural numbers are similar to the prime numbers by randomly addition of +1 and -1 to the prime numbe…
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 one prime being 3 mod 4. In general, for fixed $m$ and $a, b$ coprime to $m$, any positive even $n \equiv a + b \bmod m$ outside of a finite exceptional set is expected to be a sum of two primes $p$ and $q$ with $p \equiv a \bmod m$, $q \equiv b \bmod m$. We make conjectures about the growth of these exceptional sets.
For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive integer $a>1$ there exist a positive integer $n$ and two odd primes $p$ and $q$ such that $a$ can be expressed as a sum of the first $2n$ terms of the arithmetic progression $A(p,q)$. Notice that in the case of even $a$, this conjecture immediately follows from Goldbach's conjecture. We also propose the analogous conjecture for odd positive integers $a>1$ as w…
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 some specific prime numbers, which depends on the divisible factor of this integer, that is: For any positive integer $n~(n>2)$, if there exists an integer $m$, such that $m|n~( 1 < m < n )$, then $n=\sum_{i=1}^m p_i $, where $ p_i~(i=1,2 ,3...m)$ is prime number. In addition, for more prime summands, the combinatorial counting is also discussed. For some special cases, some brief proofs are given. By the…
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 study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} Λ(n) Λ(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such an asymptotic formula has been previously obtained only for fixed $h$ in which case our result quantitatively improves those of Heath-Brown (1983) and Tao and Teräväinen (2021). Since our main theorems work also for large $h$ we can derive new results concerning connections between Siegel zeros and the Goldbach conjecture and between Siegel zeros and primes in almost al…
We study the number of ways to decompose a monic polynomial in F_q[t] of degree n as a sum of two monic irreducible polynomials in F_q[t]. Our principal result is an asymptotic formula for the number of such representations in the case when q is large compared to n. In its range of validity, this formula agrees with what is suggested by heuristic arguments from the rational setting. We also present similar results towards an analogue of the twin prime conjecture.
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the partitions of Goldbach's conjecture. Numerical computations suggest that the lower and upper bounding functions for the partitions satisfy a simple functional equation. Assuming that this invariant scaling property holds for all even integer $n$, the lower and upper bounds can be expressed as simple exponentials.
The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(αp), α= a/q + O(1/q^2), has been a central part of the main approach to the conjecture since (Vinogradov, 1937). Previous work required q or x to be too large to make a proof of the conjecture for all n feasible. The present paper gives new bounds on minor arcs and the tails of major arcs. This is part of the author's proof of the ternary Goldbach conjecture. The new bounds are due to several qualitative improvements. In particular, this paper presen…
Let $R(n) = \sum_{a+b=n} Λ(a)Λ(b)$, where $Λ(\cdot)$ is the von Mangoldt function. The function $R(n)$ is often studied in connection with Goldbach's conjecture. On the Riemann hypothesis (RH) it is known that $\sum_{n\leq x} R(n) = x^2/2 - 4x^{3/2} G(x) + O(x^{1+ε})$, where $G(x)=\Re \sum_{γ>0} \frac{x^{iγ}}{(\frac{1}{2} + iγ)(\frac{3}{2} + iγ)}$ and the sum is over the ordinates of the nontrivial zeros of the Riemann zeta function in the upper half-plane. We prove (on RH) that each of the inequalities $G(x) < -0.02093$ and $G(x)> 0.02092$ hold infinitely often, and establish improved bounds …
In this paper, we consider $D=\mathbb{Z}[θ]$, where $$θ= \sqrt{-k} \,\,\,\, \mbox{if}\;\;\;-k\not\equiv 1 \;(\mbox{mod}\;4)\,\,\,\,\mbox{or}\,\,\,\, θ=\frac{\sqrt{-k}+1}{2} \,\,\,\, \mbox{if}\;\;\;-k\equiv 1 \;(\mbox{mod}\;4),$$ $k\geq 2$ is a squarefree integer, and we proved that the number $R(y)$ of representations of a monic polynomial $f(x)\in \mathbb{Z}[θ][x]$, of degree $d\geq 1$, as a sum of two monic irreducible polynomials $g(x)$ and $h(x)$ in $\mathbb{Z}[θ][x]$, with the coefficients of $g(x)$ and $h(x)$ bounded in complex modulus by $y$, is asymptotic to $(4y)^{2d-2}$.
We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2 \mod r$ can be written as the sum of two prime numbers $2n = p_1 + p_2$, where $p_1 \equiv b_1 \mod r$ and $p_2 \equiv b_2 \mod r$. This improves the previous result which required $r \leq N^{1/3}/\log^{O(1)}N$ instead of $r \leq N^{1/2}/\log^{O(1)}N$. We also improve some other results concerning variations of the problem.
In this paper, we compute the size of the exceptional set in a generalized Goldbach problem and show that for a given polynomial $f(x) \in \mathbb{Z}[x]$ with a positive leading coefficient, positive integers $A$, $B$, $g$ and $0 \leq i, j < g$, there are infinitely many integers $n$ which satisfy $f(n) = Ap + Bq$ for some primes $p \equiv i, q \equiv j \pmod{g}$ under a mild condition.
The ternary Goldbach conjecture states that every odd number $n\geq 7$ is the sum of three primes. The estimation of the Fourier series $\sum_{p\leq x} e(αp)$ and related sums has been central to the study of the problem since Hardy and Littlewood (1923). Here we show how to estimate such Fourier series for $α$ in the so-called major arcs, i.e., for $α$ close to a rational of small denominator. This is part of the author's proof of the ternary Goldbach conjecture. In contrast to most previous work on the subject, we will rely on a finite verification of the Generalized Riemann Hypothesis up to…
In this paper we introduce the concept of a quota complex and study how the topology of these quota complexes changes as the quota is changed. This problem is a simple "linear" version of the general question in Morse Theory of how the topology of a space varies with a parameter. We give examples of natural and basic quota complexes where this problem codifies questions about the distribution of primes, squares and divisors in number theory and as an example provide natural topological formulations of the prime number theorem, the twin prime conjecture, Goldbach's conjecture, Lehmer's conjectu…
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 the twentieth century. In 2013 -- following a line of research pioneered and developed by Hardy, Littlewood and Vinogradov, among others -- the author proved the conjecture. In this, as in many other additive problems, what is at issue is really the proper usage of the limited information we possess on the distribution of prime numbers. The problem serves a…
Shandong University（山东大学）；State Key Laboratory of Cryptography and Digital Economy Security & Mathematical Research Center Shandong University（密码学与数字经济安全国家重点实验室 & 山东大学数学研究中心）
Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good error terms gives information on the the location of zeros of L-functions and possible Siegel zeros. Similar results are obtained for an integer in a congruence class expressed as the sum of two primes.
We study the Goldbach problem for primes represented by the polynomial $x^2+y^2+1$. The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even integers $n$ satisfying certain necessary local conditions are representable as the sum of two primes of the form $x^2+y^2+1$. This improves a result of Matomäki, which tells that almost all even $n$ satisfying a local condition are the sum of one prime of the form $x^2+y^2+1$ and one generic prime. We also solve the analogous ternary Goldbach problem, stating tha…
Motivated by the Goldbach conjecture in Number Theory and the abelian bosonization mechanism on a cylindrical two-dimensional spacetime we study the reconstruction of a real scalar field as a product of two real fermion (so-called \textit{prime}) fields whose Fourier expansion exclusively contains prime modes. We undertake the canonical quantization of such prime fields and construct the corresponding Fock space by introducing creation operators $b_{p}^†$ --labeled by prime numbers $p$-- acting on the vacuum. The analysis of our model, based on the standard rules of quantum field theory and th…
Introducing and Applying S.C.E Model Under Dusart's Inequality to Prove Goldbach's Strong Conjecture for 74 Typical Structures out of All 75 Structural Types of Even Number
In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem, including Goldbach's conjecture, twin primes conjecture and Catalan's conjecture as well.
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in arithmetic progressions and in short intervals, and the Goldbach conjecture. We prove an asymptotic formula for the number of simultaneous prime values of $n$ linear functions, in the limit of a large finite field.
The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let $D(N)$ denote the number of such prime decompositions for an even $N$. It is known that $D(N)$ can be bounded above by $$ D(N) \leq C^* Θ(N), \quad Θ(N):= \frac{N}{\log^2 N}\prod_{\substack{p|N p>2}} \left( 1 + \frac{1}{p-2}\right)\prod_{p>2}\left(1-\frac{1}{(p-1)^2}\right) $$ where $C^*$ denotes Chen's constant. It is conjectured that $C^*=2$. In 2004, Wu showed that $C^* \leq 7.8209$. We attempted to replicate his work in computing Chen's constant, and in doing so we provide an improved appr…
Sylvester factor, an essential part of the asymptotic formula of Hardy and Littlewood which is the extended Goldbach conjecture, regarded as strongly multiplicative arithmetic function, has several remarkable properties.
The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this coprime version of the Schinzel Hypothesis: under some natural assumption, coprime polynomials assume coprime values at infinitely many integers. Consequences include a version "modulo an integer" of the original Schinzel Hypothesis, with the Goldbach conjecture, again modulo an integer, as a special case.
We show that the assumption of a weak form of the Hardy-Littlewood conjecture on the Goldbach problem suffices to disprove the possible existence of exceptional zeros of Dirichlet L-functions. This strengthens a result of the authors named in the title.
We show that the error term in the asymptotic formula for the Ces{à}ro mean of the singular series in the Goldbach and the Hardy-Littlewood prime-pair conjectures cannot be too small and oscillates.
Under a weakened version of Hardy-Littlewood Conjecture on the number of representations in Goldbach problem, J. H. Fei proved bounds for the Siegel zeros. Recently G. Bhowmik and K. Halupczok generalized Fei's result under a weaker conjecture. In the first version of this paper on arXiv, we pointed out a defect in the paper of G. Bhowmik and K.Halupczok, and assumed a new conjecture and used new discussion to overcome this defect to recover their result. Afterwards, in the second version of their paper, G. Bhowmik and K. Halupczok assumed previous conjecture and used our new discussion to get…
