相关论文: An update on the Linnik--Goldbach and Romanov prob…

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…

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

In this paper, we show that every pair of large even integers satisfying certain necessary conditions can be expressed as a pair of one prime, one prime square, two prime cubes and 56 powers of 2.

In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even number is the sum of two primes and at most $K$ powers of 2. Since then, this style of approximation has been considered for problems similar to…

In this paper, we prove that every pair of sufficiently large odd integers can be represented in the form of a pair of one prime, four prime cubes and $48$ powers of $2$.

In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

We prove that every sufficiently large odd integer can be expressed as a sum of one square and fourteen fifth powers, all of primes. In addition, we establish that every sufficiently large even integer can be written as a sum of one square,…

In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

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…

We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.

We establish two new Waring--Goldbach type representations: every sufficiently large odd integer $n$ can be expressed as \[ n = p_1^2 + p_2^2 + p_3^3 + p_4^3 + p_5^5 + p_6^6 + p_7^c, \] where each $p_i$ is prime and $c \in \{6,7\}$.

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…

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

By developing the method of Wooley on the quadratic Waring-Goldbach problem, we prove that all sufficiently large even integers can be expressed as a sum of four squares of primes and 46 powers of 2.

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

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}$.…

It is shown that if every odd integer $n > 5$ is the sum of three primes, then every even integer $n > 2$ is the sum of two primes. A conditional proof of Goldbach's conjecture, based on Cram\'er's conjecture, is presented. Theoretical and…