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.

In this paper, we show that every pair of sufficiently large even integers can be represented as a pair of eight prime cubes and k powers of $2$. In particular, we prove that $k=335$ is admissible, which improves the previous result.

Let N be a sufficiently large integer. We prove that, with at most $O(N^{23/48+\varepsilon })$ exceptions, all even positive integers up to N can be represented in the form $p_1^2+p_2^3+p_3^3+p_4^3+p_5^3+p_6^4$ , where $p_1,p_2,p_3,p_4,p_5,p_6$ are prime numbers.

There has been recent interest in a hybrid form of the celebrated conjectures of Hardy–Littlewood and of Chowla. We prove that for any $k,\ell \ge 1$ and distinct integers $h_2,\ldots ,h_k,a_1,\ldots ,a_\ell $, we have:

$$ \begin{align*}\sum_{n\leq X}\mu(n+h_1)\cdots \mu(n+h_k)\Lambda(n+a_1)\cdots\Lambda(n+a_{\ell})=o(X)\end{align*} $$

for all except $o(H)$ values of $h_1\leq H$, so long as $H\geq (\log X)^{\ell +\varepsilon }$. This improves on the range $H\ge (\log X)^{\psi (X)}$, $\psi (X)\to \infty $, obtained in previous work of the first author. Our results also generalise from the Möbius function $\mu $ to arbitrary (non-pretentious) multiplicative functions.

This paper is concerned with the function r3(n), the number of representations of n as the sum of at most three positive cubes,

$$r_3(n) = {\mathrm{card}}\{\mathbf m\in\mathbb Z^3: m_1^3+m_2^3+m_3^3=n, m_j\ge1\}.$$

$${\sum_{m=1}^nr_3(m),\,\sum_{m=1}^nr_3(m)^2}$$

$${\sum_{\substack{ n\le x\\ n\equiv a\,\mathrm{mod}\,q }} r_3(n).\}$$

We prove that every sufficiently large even integer can be represented as the sum of two squares of primes, four cubes of primes and 28 powers of two. This improves the result obtained by Liu and Lü [‘Two results on powers of 2 in Waring–Goldbach problem’, J. Number Theory 131(4) (2011), 716–736].

The first purpose of our paper is to show how Hooley’s celebrated method leading to his conditional proof of the Artin conjecture on primitive roots can be combined with the Hardy–Littlewood circle method. We do so by studying the number of representations of an odd integer as a sum of three primes, all of which have prescribed primitive roots. The second purpose is to analyse the singular series. In particular, using results of Lenstra, Stevenhagen and Moree, we provide a partial factorisation as an Euler product and prove that this does not extend to a complete factorisation.

We improve some results in our paper [A. Languasco and A. Zaccagnini, ‘Short intervals asymptotic formulae for binary problems with prime powers’, J. Théor. Nombres Bordeaux30 (2018) 609–635] about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell _{1}}+p_{2}^{\ell _{2}}$ and $n=p^{\ell _{1}}+m^{\ell _{2}}$, where $\ell _{1},\ell _{2}\geq 2$ are fixed integers, $p,p_{1},p_{2}$ are prime numbers and $m$ is an integer. We also remark that the techniques here used let us prove that a suitable asymptotic formula for the average number of representations of integers $n=\sum _{i=1}^{s}p_{i}^{\ell }$, where $s$, $\ell$ are two integers such that $2\leq s\leq \ell -1$, $\ell \geq 3$ and $p_{i}$, $i=1,\ldots ,s$, are prime numbers, holds in short intervals.

In this paper we show that a polynomial equation admits infinitely many prime-tuple solutions, assuming only that the equation satisfies suitable local conditions and the polynomial is sufficiently non-degenerate algebraically. Our notion of algebraic non-degeneracy is related to the $h$-invariant introduced by W. M. Schmidt. Our results prove a conjecture by B. Cook and Á. Magyar for hypersurfaces of degree 3.

Let $\mathbf{f}=(f_{1},\ldots ,f_{R})$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_{j}(x_{1},\ldots ,x_{n})=0~(1\leqslant j\leqslant R)$ satisfies a general local to global type statement, and has a solution where each coordinate is prime. In fact we obtain the asymptotic formula for number of such solutions, counted with a logarithmic weight, under these conditions. We prove the statement via the Hardy–Littlewood circle method. This is a generalization of the work of Cook and Magyar [‘Diophantine equations in the primes’, Invent. Math.198 (2014), 701–737], where they obtained the result when the polynomials of $\mathbf{f}$ all have the same degree. Hitherto, results of this type for systems of polynomial equations involving different degrees have been restricted to the diagonal case.

Assuming a conjecture on distinct zeros of Dirichlet $L$-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good error terms gives information on the location of zeros of $L$-functions. Similar results are obtained for an integer in a congruence class expressed as the sum of two primes.

In this paper we prove two results concerning Vinogradov’s three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_{1},p_{2}$ and $p_{3}$ such that, for each $i\in \{1,2,3\}$, the interval $[p_{i},p_{i}+H]$ contains at least $m$ primes, for some $H=H(m)$. Second, every sufficiently large integer $N\equiv 3~(\text{mod}~6)$ can be written as a sum of three primes $p_{1},p_{2}$ and $p_{3}$ such that, for each $i\in \{1,2,3\}$, $p_{i}+2$ has at most two prime factors.

Let ${{a}_{1}},\,.\,.\,.\,,\,{{a}_{9}}$ be non-zero integers and $n$ any integer. Suppose that ${{a}_{1}}\,+\,.\,.\,.\,+\,{{a}_{9}}\,\equiv \,n$$\left( \bmod \,2 \right)$ and $\left( {{a}_{i}},\,{{a}_{i}} \right)\,=\,1$ for $1\,\le \,i\,<\,j\le \,9$. In this paper we prove that

• (i) if ${{a}_{j}}$ are not all of the same sign, then the cubic equation ${{a}_{1}}p_{1}^{3}\,+\,.\,.\,.\,+\,{{a}_{9}}p_{9}^{3}\,=\,n$ has prime solutions satisfying ${{p}_{j}}\,\ll \,{{\left| n \right|}^{{1}/{3}\;}}\,+\,\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{8+\varepsilon }}$;

• (ii) if all ${{a}_{j}}$ are positive and $n\,\gg \,\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{25+\varepsilon }}$ , then ${{a}_{1}}p_{1}^{3}\,+\,.\,.\,.\,+\,{{a}_{j}}p_{9}^{3}\,=\,n$ is soluble in primes $Pj$.

These results improve our previous results with the bounds $\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{14+\varepsilon }}$ and $\max \,{{\left\{ \left| {{a}_{j}} \right| \right\}}^{43+\varepsilon }}$ in place of $\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{8+\varepsilon }}$ and $\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{25+\varepsilon }}$ above, respectively.

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$.

Let $A\subset \{1,\dots ,N\}$ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density ${\it\alpha}=|A|/{\it\pi}(N)$, where ${\it\pi}(N)$ denotes the number of primes in the set $\{1,\dots ,N\}$. By modifying Helfgott and De Roton’s work [Improving Roth’s theorem in the primes. Int. Math. Res. Not. IMRN2011 (4) (2011), 767–783], we improve their bound and show that

$$\begin{eqnarray}{\it\alpha}\ll \frac{(\log \log \log N)^{6}}{\log \log N}.\end{eqnarray}$$

Let ${{a}_{1}},...,{{a}_{9}}$ be nonzero integers and $n$ any integer. Suppose that ${{a}_{1}}+\cdot \cdot \cdot +{{a}_{9}}\,\equiv \,n\,\left( \bmod \,2 \right)$ and $\left( {{a}_{i}},\,{{a}_{j}} \right)\,=\,1$ for $1\,\le \,i\,<\,j\,\le \,9$. In this paper we prove the following:

(i) If ${{a}_{j}}$ are not all of the same sign, then the cubic equation ${{a}_{1}}p_{1}^{3}\,+\cdot \cdot \cdot +\,{{a}_{9}}\,p_{9}^{3}\,=\,n$ has prime solutions satisfying ${{p}_{j}}\,\ll \,{{\left| n \right|}^{{1}/{3}\;}}\,+\,\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{14+\varepsilon }}$.

(ii) If all ${{a}_{j}}$ are positive and $n\,\gg \,\max {{\left\{ \left| {{a}_{j}} \right| \right\}}^{43+\varepsilon }}$, then ${{a}_{1}}p_{1}^{3}\,+\cdot \cdot \cdot +\,{{a}_{9}}\,p_{9}^{3}\,=\,n$ is solvable in primes ${{p}_{j}}$.

These results are an extension of the linear and quadratic relative problems.

Assuming the Riemann hypothesis, we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Ω-term, we show that our result is essentially the best possible.

We prove that almost all natural numbers satisfying certain necessary congruence conditions can be written as the sum of two cubes of primes and two cubes of P2-numbers, where, as usual, we call a natural number a P2-number when it is a prime or the product of two primes. From this result we also deduce that every sufficiently large integer can be written as the sum of eight cubes of P2-numbers.