Let $\unicode[STIX]{x1D70F}(\cdot )$ be the classical Ramanujan $\unicode[STIX]{x1D70F}$-function and let $k$ be a positive integer such that $\unicode[STIX]{x1D70F}(n)\neq 0$ for $1\leqslant n\leqslant k/2$. (This is known to be true for $k<10^{23}$, and, conjecturally, for all $k$.) Further, let $\unicode[STIX]{x1D70E}$ be a permutation of the set $\{1,\ldots ,k\}$. We show that there exist infinitely many positive integers $m$ such that $|\unicode[STIX]{x1D70F}(m+\unicode[STIX]{x1D70E}(1))|<|\unicode[STIX]{x1D70F}(m+\unicode[STIX]{x1D70E}(2))|<\cdots <|\unicode[STIX]{x1D70F}(m+\unicode[STIX]{x1D70E}(k))|$. We also obtain a similar result for Hecke eigenvalues of primitive forms of square-free level.

We study the Goldbach problem for primes represented by the polynomial $x^{2}+y^{2}+1$. The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even integers $n$ satisfying certain necessary local conditions are representable as the sum of two primes of the form $x^{2}+y^{2}+1$. This improves a result of Matomäki, which tells us that almost all even $n$ satisfying a local condition are the sum of one prime of the form $x^{2}+y^{2}+1$ and one generic prime. We also solve the analogous ternary Goldbach problem, stating that every large odd $n$ is the sum of three primes represented by our polynomial. As a byproduct of the proof, we show that the primes of the form $x^{2}+y^{2}+1$ contain infinitely many three-term arithmetic progressions, and that the numbers $\unicode[STIX]{x1D6FC}p~(\text{mod}~1)$, with $\unicode[STIX]{x1D6FC}$ irrational and $p$ running through primes of the form $x^{2}+y^{2}+1$, are distributed rather uniformly.

Let $\Vert \cdots \Vert$ denote distance from the integers. Let $\unicode[STIX]{x1D6FC}$, $\unicode[STIX]{x1D6FD}$, $\unicode[STIX]{x1D6FE}$ be real numbers with $\unicode[STIX]{x1D6FC}$ irrational. We show that the inequality

$$\begin{eqnarray}\Vert \unicode[STIX]{x1D6FC}p^{2}+\unicode[STIX]{x1D6FD}p+\unicode[STIX]{x1D6FE}\Vert <p^{-3/17+\unicode[STIX]{x1D700}}\end{eqnarray}$$

$p$

$\unicode[STIX]{x1D6FC}p$

$\unicode[STIX]{x1D6FD}=0$

Let $f$ be a polynomial of degree $k>1$ with irrational leading coefficient. We obtain results of the form

$$\begin{eqnarray}\Vert f(p)\Vert <p^{-\unicode[STIX]{x1D70E}}\end{eqnarray}$$

$p$

$\unicode[STIX]{x1D6FC}p^{k}$

In this paper we show that sieve methods used previously to investigate primes in short intervals and corresponding Goldbach-type problems can be modified to obtain results on primes in Beatty sequences in short intervals.

An integer $d$ is called a jumping champion for a given $x$ if $d$ is the most common gap between consecutive primes up to $x$. Occasionally, several gaps are equally common. Hence, there can be more than one jumping champion for the same $x$. In 1999, Odlyzko et al provided convincing heuristics and empirical evidence for the truth of the hypothesis that the jumping champions greater than 1 are 4 and the primorials $2,6,30,210,2310,\ldots \,$. In this paper, we prove that an appropriate form of the Hardy–Littlewood prime $k$-tuple conjecture for prime pairs and prime triples implies that all sufficiently large jumping champions are primorials and that all sufficiently large primorials are jumping champions over a long range of $x$.

Using properties of the Frobenius eigenvalues, we show that, in a precise sense, ‘most’ isomorphism classes of (principally polarized) simple abelian varieties over a finite field are characterized, up to isogeny, by the sequence of their division fields, and we show a similar result for ‘most’ isogeny classes. Some global cases are also treated.

Let $f\in \mathbb{Z}[ x,y]$ be a reducible homogeneous polynomial of degree 3. We show that $f(x,y)$ has an even number of prime factors as often as an odd number of prime factors.

it is shown that, for all large $x$, there are more than $x^{0.33}$ carmichael numbers up to $x$, improving on the ground-breaking work of alford, granville and pomerance, who were the first to demonstrate that there are infinitely many such numbers. the same basic construction as that employed by these authors is used, but a slight modification enables a stronger result on primes in arithmetic progressions based on a sieve method to be employed.