相关论文: Definitive Proof of Goldbach's conjecture

We consider the use of Goldbach numbers as random sequences. The randomness is analyzed in terms of the autocorrelation function of the sequence of number of partitions. The distinct representations of an even number n as the sum of two…

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…

The binary problem of Goldbach is solved by the method of the trigonometrical sums. The asymptotic formula of distribution of the even numbers formed by the sum of two simple uneven numbers is found for each even number from the set of…

Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Goldbach's problem in numbers of class $\mathbb{N}_0$ is solved.

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…

We prove the following result: Let $N \geq 2$ and assume the Riemann Hypothesis (RH) holds. Then \[ \sum_{n=1}^{N} R(n) =\frac{N^{2}}{2} -2 \sum_{\rho} \frac{N^{\rho + 1}}{\rho (\rho + 1)} + O(N \log^{3}N), \] where $\rho=1/2+i\gamma$ runs…

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…

We introduce a concept of a Goldbach factorization graph (GFG) $F_n$, which can be constructed for each even integer $n$ greater than 2. We prove that, if $n$ does not satisfy the binary Goldbach conjecture (BGC), then $F_n$ contains a…

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…

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

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 note, assuming a variant of the Generalized Riemann Hypothesis, which does not exclude the existence of real zeros, we prove an asymptotic formula for the mean value of the representation function for the sum of two primes in…

In this paper, we use the former of the authors developed theory of \emph{circles of partition} to investigate possibilities to prove the binary Goldbach and Lemoine conjectures. We state the \emph{squeeze principle} and its consequences…

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,…

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

A subset of the integers larger than 1 is $primitive$ if no member divides another. Erdos proved in 1935 that the sum of $1/(a\log a)$ for $a$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he…

Goldston and Montgomery [3] proved that the Strong Pair Correlation Conjecture and two second moments of primes in short intervals are equivalent to each other under Riemann Hypothesis. In this paper, we get the second main terms for each…

Let $E(X)$ denote the number of even integers below $X$ which are not a sum of two primes. We prove the bound $E(X)=O(X^{\frac{7}{10}})$, where the implicit constant is ineffective. The method applied here also leads to $P(q)=O(q^5)$, where…

We show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…