Related papers: The distribution of smooth numbers in arithmetic p…
We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…
In this paper we study the distribution of squares modulo a square-free number $q$. We also look at inverse questions for the large sieve in the distribution aspect and we make improvements on existing results on the distribution of…
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+\delta}$ which have conveniently sized divisors. The main feature of…
We consider a problem of P. Erdos, A. M. Odlyzko and A. Sarkozy about the representation of residue classes modulo m by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to…
We prove Bombieri--Vinogradov and Barban--Davenport--Halberstam type theorems for the y-smooth numbers less than x, on the range log^{K}x \leq y \leq x. This improves on the range \exp{log^{2/3 + \epsilon}x} \leq y \leq x that was…
We study the distribution of spacings between squares modulo q, where q is square-free and highly composite, in the limit as the number of prime factors of q goes to infinity. We show that all correlation functions are Poissonian, which…
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…
Duke, Imamo\=glu, and T\'oth have recently constructed a new geometric invariant, a hyperbolic orbifold, associated to each narrow ideal class of a real quadratic field. Furthermore, they have shown that the projection of these hyperbolic…
We say that the set of $y$-smooth numbers $\mathcal{S}(N,y)$ up to $N$ is super smooth if $y=\log^KN$ for a large fixed constant $K$. We show that the Roth's theorem on arithmetic progressions is true in super smooth numbers case. This…
If a set S of pairwise coprime moduli q, less than x^(9/40), is considered, one obtains the expected behavior for primes up to x in arithmetic progressions mod q, except for a subset of S whose cardinality is bounded by a power of log x.
We establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditional on the Generalised Riemann hypothesis (GRH). As a…
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…
For a positive integer $m$, a finite set of integers is said to be equidistributed modulo $m$ if the set contains an equal number of elements in each congruence class modulo $m$. In this paper, we consider the problem of determining when…
Let $q=p^k$ be a prime power, let $n\geq2$ be an integer and let $\mathbb{F}_{q^n}$ be a finite field. It is shown that the set of primitive normal elements is a Salem set. Furthermore, it is proved that this set is strongly equidistributed…
Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If…
Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any…
Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…
A natural integer is called $y$-ultrafriable if none of the prime powers occurring in its canonical decomposition exceed $y$. We investigate the distribution of $y$-ultrafriable integers not exceeding $x$ among arithmetic progressions to…
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…
We generalize and solve the $\roman{mod}\,q$ analogue of a problem of Littlewood and Offord, raised by Vaughan and Wooley, concerning the distribution of the $2^n$ sums of the form $\sum_{i=1}^n\varepsilon_ia_i$, where each $\varepsilon_i$…