相关论文: The Hardy-Littlewood conjectures on the twin prime…
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…
Gonek, Graham, and Lee have shown recently that the Riemann Hypothesis (RH) can be reformulated in terms of certain asymptotic estimates for twisted sums with von Mangoldt function $\Lambda$. Building on their ideas, for each…
Let $(X,\mu)$ be a probability space equipped with an invertible, measure-preserving transformation $T\colon X \to X$. We exhibit a wide class of weights $w$ so that whenever $f,g \in L^{\infty}(X)$, the bilinear ergodic averages \[…
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…
Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…
Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…
We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…
Jacobsthal's function was recently generalised for the case of paired progressions. It was proven that a specific bound of this function is sufficient for the truth of Goldbach's conjecture and of the prime pairs conjecture as well. We…
In a surprising recent work, Lemke Oliver and Soundararajan noticed how experimental data exhibits erratic distributions for consecutive pairs of primes in arithmetic progressions, and proposed a heuristic model based on the…
A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…
In this paper I introduce a model which allows one to prove Goldbachs hypothesis. The model is produced by studying Goldbach partitions as displayed by an inverted mirror image of all the primes up to some even number equal to the last…
There has been recent interest in a hybrid form of the celebrated conjectures of Hardy-Littlewood and of Chowla. We prove that for any $k,\ell\ge1$ and distinct integers $h_2,\ldots,h_k,a_1,\ldots,a_\ell$, we have $$\sum_{n\leq…
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…
The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that even among the idempotent polynomials there must exist…
We survey some of the ideas behind the recent developments in additive number theory, combinatorics and ergodic theory leading to the proof of Hardy- Littlewood type estimates for the number of prime solutions to systems of linear equations…
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…
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 establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…
The prime number problem falls within the realm of number theory, specifically elementary number theory. Current research approaches have unnecessarily complicated this matter. In contrast to more advanced mathematical tools, the methods of…