Related papers: Numbers with at most $2$ prime factors in short ar…

In 2016, Dummit, Granville, and Kisilevsky showed that the proportion of semiprimes (products of two primes) not exceeding a given $x$, whose factors are congruent to $3$ modulo $4$, is more than a quarter when $x$ is sufficiently large.…

In this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an…

The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

Let $S$ be a finite set of positive integers with largest element $m$. Let us randomly select a composition $a$ of the integer $n$ with parts in $S$, and let $m(a)$ be the multiplicity of $m$ as a part of $a$. Let $0\leq r<q$ be integers,…

We prove a result on the large deviations of the central values of even primitive Dirichlet $L$-functions with a given modulus. For $V\sim \alpha\log\log q$ with $0<\alpha<1$, we show that \begin{equation}\nonumber\frac{1}{\varphi(q)} \#…

We prove asymptotics for mollified first and second moments of subfamilies of Dirichlet $L$-functions given by shrinking angular restrictions on the root number. Using these moments, we prove that for even primitive characters with prime…

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of…

Let $\langle x\rangle$ denote the distance from $x\in\mathbb{R}$ to the set of integers $\mathbb{Z}$. The Littlewood Conjecture states that for all pairs $(\alpha,\beta)\in\mathbb{R}^{2}$ the product $q\langle q\alpha\rangle\langle…

We show that almost all sectors of the disc $\{z \in \mathbb{C}: |z|^2\leq X\}$ of area $(\log X)^{15.1}$ contain products of exactly two Gaussian primes, and that almost all sectors of area $(\log X)^{1 + \varepsilon}$ contain products of…

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density…

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

Let $D<0$ be a fundamental discriminant and $h(D)$ be the class number of $\mathbb{Q}(\sqrt{D})$. Let $R(X,D)$ be the number of classes of the binary quadratic forms of discriminant $D$ which represent a prime number in the interval…

Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…