MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the current best result on the greatest lower bound on gaps between P2 almost primes where P2 represents a prime or the product of two semi-primes?

share|cite|improve this question
Last week, at Harvard, there was a "special seminar" by Yi Tang Zhang of the University of New Hampshire with the abstract "the speaker proves that there are an infinite number of pair of primes whose difference is bounded by 70 million". If this is true, this is surely the best bound for your question as well. Yet it seems too strong to be true. Anyone here who attended the talk? – Joël May 17 '13 at 17:30
I don't understand the question. According to the twin prime conjecture, gap 2 occurs infinitely often, hence one cannot give a better lower bound than 2. Perhaps you meant: how large are the gaps between P2 numbers, provably? – GH from MO May 17 '13 at 18:31
Joël: According to several experts the result seems to be true. Very astonishing indeed. – GH from MO May 17 '13 at 18:34
I imagine the question being asked is: what is the greatest lower bound on the largest gap between P2s up to $x$, as a function of $x$? In other words, an analogue for P2s of Rankin's result on large gaps between primes. – Greg Martin May 17 '13 at 19:49
@Greg and others. The burden is on the OP to clarify his question. We shouldn't be trying to guess what he means. – Felipe Voloch May 17 '13 at 19:53

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.