We prove that there are infinitely often pairs of primes much closer than the
average spacing between primes - almost within the square root of the average
spacing. We actually prove a more general result concerning the set of values
taken on by the differences between primes.
%0 Generic
%1 goldston2007primes
%A Goldston, D. A.
%A Pintz, J.
%A Yildirim, C. Y.
%D 2007
%K combinatorial mathematics tuple
%T Primes in Tuples II
%U http://arxiv.org/abs/0710.2728
%X We prove that there are infinitely often pairs of primes much closer than the
average spacing between primes - almost within the square root of the average
spacing. We actually prove a more general result concerning the set of values
taken on by the differences between primes.
@misc{goldston2007primes,
abstract = {We prove that there are infinitely often pairs of primes much closer than the
average spacing between primes - almost within the square root of the average
spacing. We actually prove a more general result concerning the set of values
taken on by the differences between primes.},
added-at = {2013-12-23T06:07:41.000+0100},
author = {Goldston, D. A. and Pintz, J. and Yildirim, C. Y.},
biburl = {https://www.bibsonomy.org/bibtex/200c5256cebb7b1247a6945d7d52596e4/aeu_research},
description = {Primes in Tuples II},
interhash = {aa3170c2ffd0536df52244cf60d316a6},
intrahash = {00c5256cebb7b1247a6945d7d52596e4},
keywords = {combinatorial mathematics tuple},
note = {cite arxiv:0710.2728Comment: 35 pages},
timestamp = {2013-12-24T01:12:55.000+0100},
title = {Primes in Tuples II},
url = {http://arxiv.org/abs/0710.2728},
year = 2007
}