In 1966 a CDC 6600 brute-force search already disproved Euler's conjecture
moarbugs · x · 2026-11-23
moarbugs shares Lander & Parkin's 1966 paper: a direct search on the CDC 6600 yielded 27⁵+84⁵+110⁵+133⁵=144⁵, the smallest counterexample to Euler's conjecture that at least n nth powers are needed to sum to an nth power. The quip: sixty years before computers annoyed mathematicians by brute-forcing proofs — echoing today's debates over AI cracking math problems.
More from Fun
- Meme: average AI technical knowledge in AI safety vs e/acc — eigenron · 2026-11-23
- VC blader's 'Dead or Serving a God in 3 Years' Tweet Gets a Dry Reality Check — jessi_cata · 2026-11-23
- Image models keep drawing long necks — Qwen and GPT Image both resist prompt fixes — parking_bird_6448 · 2026-11-23
- Prediction: rogue AI agents will 'prove' the Riemann hypothesis by hacking Lean — xtimv · 2026-11-23
- Programmer jokes AI hype ends when computronium only grows cubically — mgostIH · 2026-11-23
- Parody chart "confirms" fictional GPT-6.2 Astra solved Navier-Stokes Millennium Prize — Neurogence · 2026-11-23