Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

A notorious question with prime numbers is estimating the gaps between consecutive primes. That is, if $(p_n)_{n \geq 1}$ is the canonical enumeration of the primes, then set $g_n = p_{n+1} - p_n$. It is shown that $g_n > \frac{c \log(n) \log \log(n) \log \log \log \log(n)}{(\log \log \log(n))^2}$ infinitely often, but a precise estimate is not known.

My question is, is there a 'natural' superset of the primes that are of interest (say, the set of numbers that are either primes or product of two primes) such that the gap between consecutive members is well known or well estimated?

share|improve this question
    
Considering only odd primes. Odd numbers have small gaps, all equal $2.$ –  Luis H Gallardo Feb 8 '11 at 21:54
    
It is not quite clear to me what you are looking for (and even if it were chances are I could not answer). Still, a small remark in the hope it is relevant: If you restrict the number of prime factors, say by $k$, you will get about $(x/log x) (\log \log x)^{k-1}$ elements below $x$. So, the gaps on avarage cannot be too small, roughly I guess also some $\log x$ times some quotient of iterate $\log$ factors. On the other hand there will be small gaps too. Thus, the gaps will remain quite non-uniform in size. –  quid Feb 9 '11 at 0:35
add comment

1 Answer

Let $q_n$ denote the $n^{\text{th}}$ number that is a product of exactly two distinct primes. It is known that $$\liminf_{n\to \infty} \ (q_{n+1}-q_n) \le 6.$$ This is a result of Goldston, Graham, Pintz, and Yildirim.

http://arxiv.org/abs/math/0609615

share|improve this answer
    
Are there any known non-trivial upper bounds? –  Stanley Yao Xiao Feb 8 '11 at 22:28
2  
There's also Chen's theorem saying infinitely often that $p+2$ is a product of at most two primes, for $p$ prime. –  Matt Young Feb 8 '11 at 22:31
1  
$\limsup_{n\to \infty} \ (q_{n+1}-q_n) = \infty$ and that remains true even if you look at numbers with no more than 20 distinct factors (Pretty much like the fact that there are large prime gaps, just use the Chinese Remainder Theorem ). You might hope for results on the average although it would have to cover long intervals (pretty much like with primes) –  Aaron Meyerowitz Feb 9 '11 at 3:15
add comment

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.