Admissible sets for the Dickson-Hardy-Littlewood Conjecture
sutherland.pyimplements Andrew Sutherland's algorithm to sift intervals until they are admissible. The results are written to
admissible-py.txtand verified by
verify.pyverifies that a set is admissible
genprime.pygenerates primes and writes them to
dhl.pydoes NOT work properly in its current form, but it was meant to generate symmetric Richards-Henley sequences
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.