Exhaustive computer search finds new term a(66)=3065 for Erdős puzzle #1109
kevrussell · x · 2026-10-30
kevrussell reports that an exhaustive computer search solved a new term of Erdős puzzle #1109: a(66) = 3065, extending the published table which ended at a(65) = 2993. The result was independently confirmed by a second program, with an OEIS update pending.
More from Research
- Adobe's EditAgent routes image edits across editors with evidence-based listwise judging — adobe · 2026-10-30
- AskStream benchmark shows models struggle to ask questions proactively in streaming video — CASIA · 2026-10-30
- Co-Design Bench: top coding agents fully satisfy only 26.4% of real-user tasks — Qwen · 2026-10-30
- UniReps 2026 workshop set for December 12 in Paris — ClementineDomi6 · 2026-10-30
- Quantum randomness is falsifiable but never verifiable: a Kolmogorov-complexity argument — jessi_cata · 2026-10-30
- A 6-month roadmap for students to break into ML research, from paper reproduction to contacting labs — cneuralnetwork · 2026-10-30