2000 character limit reached
Bounded length intervals containing two primes and an almost-prime II
Published 5 Jun 2013 in math.NT | (1306.0948v1)
Abstract: Zhang has shown there are infinitely many intervals of bounded length containing two primes. It appears that the current techniques cannot prove that there are infinitely many intervals of bounded length containing three primes, even if strong conjectures such as the Elliott-Halberstam conjecture are assumed. We show that there are infinitely many intervals of length at most $108$ which contain two primes and a number with at most 31 prime factors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.