Inspired by the work of Bourgain and Garaev (2013), we provide new bounds for certain weighted bilinear Kloosterman sums in polynomial rings over a finite field. As an application, we build upon and extend some results of Sawin and Shusterman (2022). These results include bounds for exponential sums weighted by the Möbius function and a level of distribution for irreducible polynomials beyond 1/2, with arbitrary composite modulus. Additionally, we can do better when averaging over the modulus, to give an analogue of the Bombieri-Vinogradov Theorem with a level of distribution even further beyond 1/2.

We study the exact Hausdorff and packing dimensions of the prime Cantor set, $\Lambda _P$, which comprises the irrationals whose continued fraction entries are prime numbers. We prove that the Hausdorff measure of the prime Cantor set cannot be finite and positive with respect to any sufficiently regular dimension function, thus negatively answering a question of Mauldin and Urbański (1999) and Mauldin (2013) for this class of dimension functions. By contrast, under a reasonable number-theoretic conjecture we prove that the packing measure of the conformal measure on the prime Cantor set is in fact positive and finite with respect to the dimension function $\psi (r) = r^\delta \log ^{-2\delta }\log (1/r)$, where $\delta $ is the dimension (conformal, Hausdorff, and packing) of the prime Cantor set.

Let $\mathcal {P}$ be the set of primes and $\pi (x)$ the number of primes not exceeding x. Let $P^+(n)$ be the largest prime factor of n, with the convention $P^+(1)=1$, and $ T_c(x)=\#\{p\le x:p\in \mathcal {P},P^+(p-1)\ge p^c\}. $ Motivated by a conjecture of Chen and Chen [‘On the largest prime factor of shifted primes’, Acta Math. Sin. (Engl. Ser.) 33 (2017), 377–382], we show that for any c with $8/9\le c<1$,

$$ \begin{align*} \limsup_{x\rightarrow\infty}T_c(x)/\pi(x)\le 8(1/c-1), \end{align*} $$

which clearly means that

$$ \begin{align*} \limsup_{x\rightarrow\infty}T_c(x)/\pi(x)\rightarrow 0 \quad \text{as } c\rightarrow 1. \end{align*} $$

A positive even number is said to be a Maillet number if it can be written as the difference between two primes, and a Kronecker number if it can be written in infinitely many ways as the difference between two primes. It is believed that all even numbers are Kronecker numbers. We study the division and multiplication of Kronecker numbers and show that these numbers are rather abundant. We prove that there is a computable constant k and a set D consisting of at most 720 computable Maillet numbers such that, for any integer n, $kn$ can be expressed as a product of a Kronecker number and a Maillet number in D. We also prove that every positive rational number can be written as a ratio of two Kronecker numbers.

A set of integers greater than 1 is primitive if no member in the set divides another. Erdős proved in 1935 that the series $f(A) = \sum _{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets A. In 1986, he asked if this bound is attained for the set of prime numbers. In this article, we answer in the affirmative.

As further applications of the method, we make progress towards a question of Erdős, Sárközy and Szemerédi from 1968. We also refine the classical Davenport–Erdős theorem on infinite divisibility chains, and extend a result of Erdős, Sárközy and Szemerédi from 1966.

Fujii obtained a formula for the average number of Goldbach representations with lower-order terms expressed as a sum over the zeros of the Riemann zeta function and a smaller error term. This assumed the Riemann Hypothesis. We obtain an unconditional version of this result and obtain applications conditional on various conjectures on zeros of the Riemann zeta function.

For a fixed integer h, the standard orthogonality relations for Ramanujan sums $c_r(n)$ give an asymptotic formula for the shifted convolution $\sum _{n\le N} c_q(n)c_r(n+h)$. We prove a generalised formula for affine convolutions $\sum _{n\le N} c_q(n)c_r(kn+h)$. This allows us to study affine convolutions $\sum _{n\le N} f(n)g(kn+h)$ of arithmetical functions $f,g$ admitting a suitable Ramanujan–Fourier expansion. As an application, we give a heuristic justification of the Hardy–Littlewood conjectural asymptotic formula for counting Sophie Germain primes.

Let $\omega ^*(n)$ be the number of primes p such that $p-1$ divides n. Recently, M. R. Murty and V. K. Murty proved that

$$ \begin{align*}x(\log\log x)^3\ll\sum_{n\le x}\omega^*(n)^2\ll x\log x.\end{align*} $$

They further conjectured that there is some positive constant C such that

$$ \begin{align*}\sum_{n\le x}\omega^*(n)^2\sim Cx\log x,\end{align*} $$

as $x\rightarrow \infty $ . In this short note, we give the correct order of the sum by showing that

$$ \begin{align*}\sum_{n\le x}\omega^*(n)^2\asymp x\log x.\end{align*} $$

We establish the optimal order of Malliavin-type remainders in the asymptotic density approximation formula for Beurling generalized integers. Given $\alpha \in (0,1]$ and $c>0$ (with $c\leq 1$ if $\alpha =1$), a generalized number system is constructed with Riemann prime counting function $ \Pi (x)= \operatorname {\mathrm {Li}}(x)+ O(x\exp (-c \log ^{\alpha } x ) +\log _{2}x), $ and whose integer counting function satisfies the extremal oscillation estimate $N(x)=\rho x + \Omega _{\pm }(x\exp (- c'(\log x\log _{2} x)^{\frac {\alpha }{\alpha +1}})$ for any $c'>(c(\alpha +1))^{\frac {1}{\alpha +1}}$, where $\rho>0$ is its asymptotic density. In particular, this improves and extends upon the earlier work [Adv. Math. 370 (2020), Article 107240].

We prove that the Riemann hypothesis is equivalent to the condition $\int _{2}^x\left (\pi (t)-\operatorname {\textrm {li}}(t)\right )\textrm {d}t<0$ for all $x>2$ . Here, $\pi (t)$ is the prime-counting function and $\operatorname {\textrm {li}}(t)$ is the logarithmic integral. This makes explicit a claim of Pintz. Moreover, we prove an analogous result for the Chebyshev function $\theta (t)$ and discuss the extent to which one can make related claims unconditionally.

Let $g \geq 1$ be an integer and let $A/\mathbb Q$ be an abelian variety that is isogenous over $\mathbb Q$ to a product of g elliptic curves defined over $\mathbb Q$ , pairwise non-isogenous over $\overline {\mathbb Q}$ and each without complex multiplication. For an integer t and a positive real number x, denote by $\pi _A(x, t)$ the number of primes $p \leq x$ , of good reduction for A, for which the Frobenius trace $a_{1, p}(A)$ associated to the reduction of A modulo p equals t. Assuming the Generalized Riemann Hypothesis for Dedekind zeta functions, we prove that $\pi _A(x, 0) \ll _A x^{1 - \frac {1}{3 g+1 }}/(\operatorname {log} x)^{1 - \frac {2}{3 g+1}}$ and $\pi _A(x, t) \ll _A x^{1 - \frac {1}{3 g + 2}}/(\operatorname {log} x)^{1 - \frac {2}{3 g + 2}}$ if $t \neq 0$ . These bounds largely improve upon recent ones obtained for $g = 2$ by Chen, Jones, and Serban, and may be viewed as generalizations to arbitrary g of the bounds obtained for $g=1$ by Murty, Murty, and Saradha, combined with a refinement in the power of $\operatorname {log} x$ by Zywina. Under the assumptions stated above, we also prove the existence of a density one set of primes p satisfying $|a_{1, p}(A)|>p^{\frac {1}{3 g + 1} - \varepsilon }$ for any fixed $\varepsilon>0$ .

We prove that most permutations of degree $n$ have some power which is a cycle of prime length approximately $\log n$. Explicitly, we show that for $n$ sufficiently large, the proportion of such elements is at least $1-5/\log \log n$ with the prime between $\log n$ and $(\log n)^{\log \log n}$. The proportion of even permutations with this property is at least $1-7/\log \log n$.

We prove that neither a prime nor an l-almost prime number theorem holds in the class of regular Toeplitz subshifts. But when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler’s totient function is assumed, then the two theorems hold.

Let $K=\mathbb{Q}(\unicode[STIX]{x1D714})$ with $\unicode[STIX]{x1D714}$ the root of a degree $n$ monic irreducible polynomial $f\in \mathbb{Z}[X]$. We show that the degree $n$ polynomial $N(\sum _{i=1}^{n-k}x_{i}\unicode[STIX]{x1D714}^{i-1})$ in $n-k$ variables takes the expected asymptotic number of prime values if $n\geqslant 4k$. In the special case $K=\mathbb{Q}(\sqrt[n]{\unicode[STIX]{x1D703}})$, we show that $N(\sum _{i=1}^{n-k}x_{i}\sqrt[n]{\unicode[STIX]{x1D703}^{i-1}})$ takes infinitely many prime values, provided $n\geqslant 22k/7$.

Our proof relies on using suitable ‘Type I’ and ‘Type II’ estimates in Harman’s sieve, which are established in a similar overall manner to the previous work of Friedlander and Iwaniec on prime values of $X^{2}+Y^{4}$ and of Heath-Brown on $X^{3}+2Y^{3}$. Our proof ultimately relies on employing explicit elementary estimates from the geometry of numbers and algebraic geometry to control the number of highly skewed lattices appearing in our final estimates.

We show that for all large enough x the interval [x, x + x1/2 log1.39x] contains numbers with a prime factor p > x18/19. Our work builds on the previous works of Heath–Brown and Jia (1998) and Jia and Liu (2000) concerning the same problem for the longer intervals [x, x + x1/2 + ϵ]. We also incorporate some ideas from Harman’s book Prime-detecting sieves (2007). The main new ingredient that we use is the iterative argument of Matomäki and Radziwiłł (2016) for bounding Dirichlet polynomial mean values, which is applied to obtain Type II information. This allows us to take shorter intervals than in the above-mentioned previous works. We have also had to develop ideas to avoid losing any powers of log x when applying Harman’s sieve method.

In this note we examine Littlewood’s proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the nonvanishing of Riemann’s zeta-function on the one-line. Our approach goes through the theory of almost periodic functions and is self-contained.

We prove that for every sufficiently large integer $n$, the polynomial $1+x+x^{2}/11+x^{3}/111+\cdots +x^{n}/111\ldots 1$ is irreducible over the rationals, where the coefficient of $x^{k}$ for $1\leqslant k\leqslant n$ is the reciprocal of the decimal number consisting of $k$ digits which are each $1$. Similar results following from the same techniques are discussed.

Let $h(n)$ denote the largest product of distinct primes whose sum does not exceed $n$. The main result of this paper is that the property for all $n\geq 1$, we have $\log h(n)<\sqrt{\text{li}^{-1}(n)}$ (where $\text{li}^{-1}$ denotes the inverse function of the logarithmic integral) is equivalent to the Riemann hypothesis.