Related papers: A note on Primes in Short Intervals

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong…

In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.

A Hardy-Littlewood triple is a 3-tuple of integers with the form $(n, n+2, n+6)$. In this paper, we study Hardy-Littlewood triples of the form $(p, P_{a}, P_{b})$ and improve the upper and lower bound orders of it, where $p$ is a prime and…

We prove that there are infinitely often pairs of primes much closer than the average spacing between primes - almost within the square root of the average spacing. We actually prove a more general result concerning the set of values taken…

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly…

We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples…

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

We discuss properties of certain generalization of Power Means proposed in 1971 by Carlson, Meany and Nelson. For any fixed parameter (k,s,q) and vector (v_1,...,v_n) they take the q-th power means of all possible k-tuples…

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

Let $1<c<d$ be two relatively prime integers and $g_{c,d}=cd-c-d$. We confirm, by employing the Hardy--Littlewood method, a 2020 conjecture of Ram\'{\i}rez Alfons\'{\i}n and Ska{\l}ba which states that $$#\left\{p\le g_{c,d}:p\in…

The authors transpose a discrete notion of indetermination coupling in the case of continuous probabilities. They show that this coupling, expressed on densities, cannot be captured by a specific copula which acts on cumulative distribution…

Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…

Holroyd and Propp used Hall's marriage theorem to show that, given a probability distribution pi on a finite set S, there exists an infinite sequence s_1,s_2,... in S such that for all integers k >= 1 and all s in S, the number of i in…