OpenAI reports: Erdős’s reciprocal-sum progression conjecture
OpenAI reports that every positive-integer set with divergent reciprocal sum contains arithmetic progressions of every finite length, through fixed-length bounds r_k(N)≤C_k N exp(−c_k(log N)^ε_k).
Read original source Original manuscript: claim, hypotheses, and contextgithub.com
Original report: 2026-10-06