相关论文: The Hardy-Littlewood conjectures on the twin prime…

We prove the twin prime conjecture and the generalized conjectures of Kronecker and Polignac. Key to the proofs is a new theoretical sieve that combines two concepts that go back to Eratosthenes: the 'sieve' filtering a finite set of…

Let $\Lambda\left(n\right)$ be the von Mangoldt function and $r_{G}\left(n\right) := \sum_{m_1 + m_2=n} \Lambda \left(m_1 \right) \Lambda\left(m_2 \right)$ be the counting function for the numbers that can be written as sum of two primes…

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…

A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations…

n 1937 Ivan Vinogradov proved the three prime sum version of the Goldbach Conjecture, often called the weak form of Goldbach Conjecture. And that it holds for "sufficiently large" odd natural numbers. In this work we use Dirichlet Theorem,…

We prove precise conditional estimates for the third moment of the logarithm of the Riemann zeta function, refining what is implied by the Selberg central limit theorem, both for the real and imaginary parts. These estimates match…

Polynomial-in-time algorithms for computing classical Hurwitz numbers were given in [4] based on the Pandharipande equation. The paritition function of double Hurwitz numbers was proved [21] to satisfy the 2-Toda hierarchy. In this paper,…

In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.

We establish lower bounds for all weighted even moments of primes up to $X$ in intervals which are in agreement with a conjecture of Montgomery and Soundararajan. Our bounds hold unconditionally for an unbounded set of values of $X$, and…

According to the similarity theorem on the distributions of the effective prime factors and by using two-part method, Goldbach theorem and, consequently, Goldbach conjecture was proved.

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we…

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

A scarcely known generalization of Goldbach's conjecture introduced by Hardy and Littlewood states that for every pair of (relatively prime) positive integers m1 and m2, every sufficiently large integer n satisfying certain simple…

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…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…

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 prove a formula for the Mangoldt function which relates it to a sum over all the non-trivial zeros of the Riemann zeta function, in addition we analize a truncated version of it.

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

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…