相关论文: The first moment of primes in arithmetic progressi…

We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

We prove that the $k$-th positive integer moment of partial sums of Steinhaus random multiplicative functions over the interval $(x, x+H]$ matches the corresponding Gaussian moment, as long as $H\ll x/(\log x)^{2k^2+2+o(1)}$ and $H$ tends…

Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv…

Let $I$ and $J$ be two intervals, and let $f, g: I \rightarrow \mathbb{R}$. If for any points $a$ and $b$ in $I$ and any positive numbers $p$ and $q$ such that $p + q = 1$, we have \begin{align} \nonumber p f(a) + q f(b) + g(pa + qb) \in J,…

We study multiplicative functions $f$ satisfying $|f(n)|\le 1$ for all $n$, the associated Dirichlet series $F(s):=\sum_{n=1}^{\infty} f(n) n^{-s}$, and the summatory function $S_f(x):=\sum_{n\le x} f(n)$. Up to a possible trivial…

We evaluate asymptotically the smoothed first moment of central values of families of quadratic, cubic, quartic and sextic Hecke $L$-functions over various imaginary quadratic number fields of class number one, using the method of double…

In this paper, we prove analogues of the Dirichlet theorem on arithmetic progressions and the Siegel--Walfisz theorem for the digital reverses of primes for arbitrary bases, which the authors obtained in the previous paper but only for…

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…

We survey results about prime number races, that is, results about the relative sizes of prime counting functions $\pi_{q,a}(x)$, with $q$ fixed and $a$ varying. In particular, we describe recent work by the authors on these problems.

Let $x \in [0,1)$ with continued fraction expansion $[a_1(x),a_2(x),\dots]$, and let $\phi:\mathbb{N}\to\mathbb{R}^+$ be a non-decreasing function. We consider the numbers whose continued fraction expansions contain at least two partial…

Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

Let $\psi:\mathbb{N}\to\mathbb{R}_{\ge0}$ be an arbitrary function from the positive integers to the non-negative reals. Consider the set $\mathcal{A}$ of real numbers $\alpha$ for which there are infinitely many reduced fractions $a/q$…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

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 $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$\delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…