3-tuples have at most 7 prime factors infinitely often

DOI10.1017/S0305004113000339zbMath1304.11105arXiv1205.5021OpenAlexW3105476269MaRDI QIDQ5401532

James Maynard

Publication date: 10 March 2014

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.5021

zbMATH Keywords

Selberg sieveprime tuples

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Distribution of primes (11N05) Sieves (11N35)

Related Items (6)

Groups with bounded centralizer chains and the Borovik-Khukhro conjecture ⋮ Small gaps between the set of products of at most two primes ⋮ Almost primes in various settings ⋮ Triples of almost primes ⋮ Counting primes ⋮ Almost prime triples and Chen's theorem

Cites Work

• Unnamed Item
• On almost prime \(k\)-tuples
• An induction principle for the generalization of Bombieri's prime number theorem
• Almost‐prime k ‐tuples

This page was built for publication: 3-tuples have at most 7 prime factors infinitely often