Let $\mathcal{H}=\left\{ h\_{i}\right\} \_{i=1}^{k}$ be an admissible set, and define $$\pi\_{\mathcal{H}}(x)=\left|\left\{ n\leq x\ :\ \exists\ i,j\leq k,\ i\neq j\ \text{such that both }n+h\_{i},\ n+h\_{j}\ \text{are prime}\right\} \right|.$$ The [Hardy-Littlewood](http://en.wikipedia.org/wiki/First_Hardy%E2%80%93Littlewood_conjecture#First_Hardy.E2.80.93Littlewood_conjecture) $k$-tuple conjecture implies that $$\pi\_{\mathcal{H}}(x)\sim C\_{\mathcal{H}}\frac{x}{\log^{2}x},$$ where $C\_{\mathcal{H}}$ is a constant depending on $\mathcal{H},$ and the [Selberg sieve](http://en.wikipedia.org/wiki/Selberg_sieve) can be used to prove that $$\pi\_{\mathcal{H}}(x)\ll\_{\mathcal{H}}\frac{x}{\log^{2}x}.$$ Yitang Zhang recently proved that for any sufficiently large admissible set $\mathcal{H}$, we have $$\lim\_{x\rightarrow\infty}\pi\_{\mathcal{H}}(x)\rightarrow\infty.$$ (the current lower bound on $\mathcal{H}$ can be [found here](http://michaelnielsen.org/polymath1/index.php?title=Bounded_gaps_between_primes))



> 
> **Question:** Does Zhang's work give a lower bound on $\pi\_{\mathcal{H}}$ with the correct order of magnitude? That is, can we prove that $$\pi\_{\mathcal{H}}(x)\gg\_{\mathcal{H}}\frac{x}{\log^{2}x}?$$
> 
> 
> 



Quantitative lower bounds related to Zhang's theorem on bounded gaps
In the main theorem of [this recent paper of Pintz](http://arxiv.org/abs/1305.6289), Zhang's method is used to show that (for $k$ large enough), there are $\gg\_{\mathcal H} \frac{x}{\log^k x}$ values of $n \le x$ such that two of the $n+h\_i$ are prime and the remaining $n+h\_j$ are almost prime (have $O\_k(1)$ prime factors, all of which are $\gg x^{c\_k}$ for some $c\_k>0$ independent of $x$). This is the correct asymptotic (up to multiplicative constants) if one enforces the almost primality conditions, but has the wrong power of log in the denominator if those conditions are removed.


In a slightly different direction, in [this paper of Goldston, Pintz, and Yildirim](http://www.ams.org/mathscinet-getitem?mr=2907978) (a followup to their most famous paper), it is shown that for any fixed $\varepsilon>0$, there are $\gg\_\varepsilon \frac{x}{\log x}$ primes $p\_n$ less than $x$ such that $p\_{n+1}-p\_n \leq \varepsilon \log p\_n$. Again, this is the correct asymptotic up to multiplicative constants.


I have a graduate student who has recently started looking at improvements to these results, with some encouraging preliminary findings, but the work is not yet completed. It is indeed unlikely that one will be able to obtain the optimal asymptotic here unconditionally, but some improvement upon the partial results given above look plausible.


