J. Maynard

activity

20122023

most citedVinogradov's theorem with almost equal summands

27 citations · 112 across the 25 of their papers we have counts for

collaborators

Showing 2016 · math.NTShow all

3 papers · 2 filters

math.NT2016★ 27 cited

Vinogradov's theorem with almost equal summands

Kaisa Matomäki, James Maynard, Xuancheng Shao

Let $θ > 11/20$ . We prove that every sufficiently large odd integer $n$ can be written as a sum of three primes $n = p_{1} + p_{2} + p_{3}$ with $∣ p_{i} - n /3∣ \leq n^{θ}$ for $i \in {1, 2, 3}$ …

math.NT2016

Sieve weights and their smoothings

Andrew Granville, Dimitris Koukoulopoulos, James Maynard

We obtain asymptotic formulas for the $2 k$ th moments of partially smoothed divisor sums of the Möbius function. When $2 k$ is small compared with $A$ , the level of smoothing, then t…

math.NT2016

Primes with restricted digits

James Maynard

Let $a_{0} \in {0, \dots, 9}$ . We show there are infinitely many prime numbers which do not have the digit $a_{0}$ in their decimal expansion. The proof is an application of the Hardy-Li…