GPT Astra Helps Advance Lower Bound on Erdős Problem #357

Kevin Russell, assisted by GPT Astra, reports a candidate improvement on Erdős problem #357 for arbitrary orderings, potentially breaking the 1986 bound of 3/2 for k ≥ 10²², with Lean verification pending human review; he clarifies the stronger Coppersmith–Phillips bound applies only to increasing sequences.

2026-11-03 ~ 2026-11-03 · 3 related posts

• Lean-checked step past 1986 bound on Erdős #357, argued with GPT Astra — kevrussell · 2026-11-03
• GPT Astra-assisted proof improves Erdős Problem #357 bound, Lean-verified but not refereed — kevrussell · 2026-11-03
• Erdős #357 follow-up: stronger Coppersmith–Phillips bound read as increasing-only — kevrussell · 2026-11-03