Skip to main content
MathOverflow

Return to Answer

Name of article, while this is on the front page
Source Link
LSpice
LSpice
  • 12.9k
  • 4
  • 45
  • 69

https://arxiv.org/abs/1412.5029Ford, Green, Konyagin, Maynard, and Tao - Long gaps between primes mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

https://arxiv.org/abs/1412.5029 mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

Ford, Green, Konyagin, Maynard, and Tao - Long gaps between primes mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

http -> https (the question was bumped anyway)
Source Link
Martin Sleziak
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

http://arxiv.org/abs/1412.5029https://arxiv.org/abs/1412.5029 mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

http://arxiv.org/abs/1412.5029 mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

https://arxiv.org/abs/1412.5029 mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

Source Link
The Masked Avenger
The Masked Avenger
  • 2.2k
  • 1
  • 15
  • 19

http://arxiv.org/abs/1412.5029 mentions a hypergraph covering theorem of Pippenger and Spencer. This theorem is generalized and used in a sieving method to find large intervals having only composite numbers.

Post Made Community Wiki by The Masked Avenger