Related papers: Primes in arithmetic progressions to large moduli …

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the…

In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.

We prove Bombieri-Vinogradov type theorems for primes with a missing digit in their $b$-adic expansion for some large positive integer $b$. The proof is based on the circle method, which relies on the Fourier structure of the integers with…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

We prove a new mean value theorem on the distribution of primes in two simultaneous arithmetic progressions. Our approach builds on previous arguments of Bombieri, Fouvry, Friedlander, and Iwaniec appealing to spectral theory of Kloosterman…

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

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$,…

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke,…

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…

In this paper, we establish theorems of Bombieri-Vinogradov type and Barban-Davenport-Halberstam type for sparse sets of moduli. As an application, we prove that there exist infinitely many primes of the form $p=am^2+1$ such that $a\leq…

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with…

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

We investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of…

Let $\lambda$ be a fixed integer, $\lambda\ge 2.$ Let $s_n$ be any strictly increasing sequence of positive integers satisfying $s_n\le n^{15/14+o(1)}.$ In this paper we give a version of the large sieve inequality for the sequence…

We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.