On Friday 07 September 2012 20:47:08 Warren Smith wrote:
A "P2" is the product of exactly 2 primes. ...
The most that is rigorously known about upper-bounding prime gaps is, ... A well-known mathematician suggested to me that perhaps a much stronger upper bound would be possible (or was already known), [...] if we considered gaps between, not "primes," but rather "primes U P2's."
I counter-argued that since P2s are much rarer than primes, that seemed silly; [...]
Aside from what's already been pointed out, namely that P2s are commoner than primes rather than rarer, note the difference between (1) what the biggest gaps *are*, (2) what typical gaps are, and (3) the best bound we can prove on either. For instance: the numbers floor(n (log n)^2) are rarer than the primes "by about a factor log n" but the gap between two of these of size ~n is only on the order of (log n)^2, much smaller than the biggest gaps between consecutive primes; and if we take these numbers and perturb them in a suitable (well controlled) way we can make the biggest gaps between them *provably* about as big as the biggest gaps between primes are conjectured to be. The fact that these numbers are rarer than the primes, and therefore have bigger gaps on average, is neither here nor there. -- g