Admissible sets for the Dickson-Hardy-Littlewood Conjecture
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
LICENSE
README.md
admissible-py.txt
dhl.py
genprime.py
primes.txt
sutherland.py
verify.py

README.md

dhl

Admissible sets for the Dickson-Hardy-Littlewood Conjecture

Overview

  • sutherland.py implements Andrew Sutherland's algorithm to sift intervals until they are admissible. The results are written to admissible-py.txt and verified by verify.py

  • verify.py verifies that a set is admissible

  • genprime.py generates primes and writes them to primes.txt

  • dhl.py does NOT work properly in its current form, but it was meant to generate symmetric Richards-Henley sequences

Results

sutherland.py currently sifts the interval [-185662, 202456] to create an admissible set with 34429 elements and diameter 388118, which yields the current world record on bounded gaps between primes.

See Also