arXiv Analytics

Sign in

arXiv:1205.5021 [math.NT]AbstractReferencesReviewsResources

3-tuples have at most 7 prime factors infinitely often

James Maynard

Published 2012-05-22Version 1

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 factors, improving a result of Porter. We do this by means of a weighted sieve based upon the Diamond-Halberstam-Richert multidimensional sieve.

Comments: 13 Pages
Categories: math.NT
Subjects: 11N05, 11N35, 11N36
Related articles: Most relevant | Search more
arXiv:1111.2003 [math.NT] (Published 2011-11-08)
Reducing the number of prime factors of long $κ$-tuples
arXiv:1511.02388 [math.NT] (Published 2015-11-07)
Orders of reductions of elliptic curves with many and few prime factors
arXiv:1205.5020 [math.NT] (Published 2012-05-22)
Bounded length intervals containing two primes and an almost-prime

Links

Toolbox