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 2012 · math.NTShow all

3 papers · 2 filters

math.NT2012★ 7 cited

3-tuples have at most 7 prime factors infinitely often

James Maynard

Let $L_{1}$ , $L_{2}$ $L_{3}$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_{1} (n) L_{2} (n) L_{3} (n)$ has at most 7 prime…

math.NT2012★ 7 cited

Bounded length intervals containing two primes and an almost-prime

James Maynard

Goldston, Pintz and Yıldırım have shown that if the primes have `level of distribution' $θ$ for some $θ > 1/2$ then there exists a constant $C (θ)$ , such that there are infinitely man…

math.NT2012

Almost-prime $k$ -tuples

James Maynard

Let $k \geq 2$ and $Π (n) = \prod_{i = 1}^{k} (a_{i} n + b_{i})$ for some integers $a_{i}, b_{i}$ ( $1 \leq i \leq k$ ). Suppose that $Π (n)$ has no fixed prime divisors. Weighted sieves have shown for infini…

3-tuples have at most 7 prime factors infinitely often

Bounded length intervals containing two primes and an almost-prime

Almost-prime k-tuples

Almost-prime $k$ -tuples