Related papers: Large gaps between primes in arithmetic progressio…
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…
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…
We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that a positive proportion of consecutive primes are within a…
ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…
This is the first of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…
Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…
In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…
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 investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
We prove an analogue of a result by Goldston, Pintz and Yildirim for small gaps between primes that split completely in an abelian number field. We prove both a conditional result assuming the Elliott-Halberstam conjecture, and an…
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…
We study arithmetic functions $\Phi(x;d,a)$, called prime running functions, whose value at $x$ sums the gaps between primes $p_k \equiv a\ (\text{mod}\ d)$ below $x$ and the next following prime $p_{k+1}$, up to $x$. (The following prime…
We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.
In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.
We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…
We obtain asymptotic results on the average numbers of Goldbach representations of an interger as the sum of two primes in different arithmetic progressions. We also prove an omega-result showing that the asymptotic result is essentially…
We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…
B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…