New record on Erdős problem #357: exhaustive searches pin A364153(18) = 28, proof still open
kevrussell · x · 2026-10-30
kevrussell reports new terms on Erdős problem #357 found by exhaustive computer search, each confirmed by a second independent program: A364132(28) = 75, and now A364153(18) = 28 — three 18-term examples exist using numbers up to 28, while searches over 1..27 found none. He stresses these are exhaustive searches, not proofs, and the problem remains open.
More from Research
- Epoch data: leading chips get ~40% more efficient yearly, but AI power draw keeps climbing — teortaxesTex · 2026-10-30
- Soft-MTP: a one-line fix removes noisy gradients from multi-token prediction — pmttyji · 2026-10-30
- Vicki Boykis on ONNX inference for retrieval and ranking: slides from DataPhilly talk — vboykis · 2026-10-30
- Agentic MRI review takes 9th place out of 6299 teams in Kaggle RSNA knee abnormality detection — kagglingdieter · 2026-10-30
- Meta's RoboJEPA: First Scaling Laws for Multi-Embodiment Robotic World Models — apsarathchandar · 2026-10-30
- Agent harness engineering: lessons from 57 papers — same model, 6x performance gap — Marmelab · 2026-10-30