Related papers: Sieve Method and Landau Problem
By creating a new method, the author proved the well-known world's baffling problems Goldbach conjecture, twin primes conjecture, the Proposition (C) and the Proposition $n^2+1$.
In this paper, we used the principle of sieve function transformation to improve sieve method and the prime number theorem in the arithmetic sequence.For this, we proved General Riemann Hypothesis and Riemann Hypothesis to be true. further,…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
We give a more comrehensive treatment of Chen's double sieve and improve related constants in Goldbach's conjecture and the twin prime problem.
In the paper, there are new found methods to determine the range of every exceptional element in exceptional set, we can solve Twin primes problem and Goldbach Conjecture problem basically.
This is a work in two parts devoted to solutions of the so-called {\em four Landau's problems} in Number Theory, listed by Edmund Landau at the 1912 International Congress of Mathematics. In Part I the {\em Goldbach's conjecture} is proved.…
This paper proposes, and demonstrates the efficacy of, an elementary method for establishing a lower bound for cardinalities of selected sets of twin primes, and shows that the proof employed may be modified for selected sets of Goldbach…
We present a novel approach to the Twin Prime Conjecture, basing on the $6x \pm 1$ representation of primes. By defining so-called twin prime generators $x \in \N$, for which both $6x - 1$ and $6x + 1$ are prime, we reformulate the…
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…
We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
In this paper proof of the twin prime conjecture is going to be presented. Originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved. It will be shown that…
A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…
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…
We construct nonminimal and irreducible solutions to the Ginzburg-Landau equations on closed manifolds of arbitrary dimension with trivial first real cohomology. Our method uses bifurcation theory where the "bifurcation points" are…
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 consider the ternary Goldbach problem with two prime variables of the form $k^2+m^2+1$ and find an asymptotic formula for the number of its solutions.
In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…