相关论文: Primes in Tuples II

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.

For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…

Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

We show that $$\sum_{\substack{p_n \in [x, 2x] \\ p_{n+1} - p_n \ge x^{1/2}}} (p_{n+1} - p_n) \ll x^{0.57+\epsilon}$$ and $$\sum_{\substack{p_n \in [x, 2x] \\ p_{n+1} - p_n \ge x^{0.45}}} (p_{n+1} - p_n) \ll x^{0.63+\epsilon},$$ where $p_n$…

In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for…

The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…

We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…

We proved that there are infinitely many cousin primes.

This note investigates the average density of prime numbers $p\in[x,2x]$ with respect to a random simultaneous primitive root $g\leq p^{1/2+\varepsilon}$ over the finite rings $\mathbb{Z}/p\mathbb{Z}$ and $\mathbb{Z}/p^2\mathbb{Z}$ as $x…

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

Extending the works of Alladi and Sweeting and Woo, we state and prove the general higher order duality between prime ideals in number rings. We then use the second order duality to obtain the a new formula for the Chebotarev Density…

For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable…

The author proves that for $0.9985 < \gamma < 1$, there exist infinitely many primes $p$ such that $[p^{1/\gamma}]$ has at most 5 prime factors counted with multiplicity. This gives an improvement upon the previous results of…

We study Gaussian primes lying in narrow sectors, and show that almost all such sectors contain the expected number of primes, if the sectors are not too narrow.