We haven't resolved whether it's possible to prove the exact largest possible size of certain mathematical structures without relying on exhaustive computer search.
open
Mathematics & Logic
Some extremal problems in combinatorics have only been resolved through massive computational brute force, without a more elegant general proof explaining why the answer must be exactly what it is. This unresolved gap raises questions about the nature of mathematical understanding itself.
Team Humans Club. (2026). Problem WS01299: We haven't resolved whether it's possible to prove the exact largest possible size of certain mathematical structures without relying on exhaustive computer search.. World Solve. Retrieved 20 Jul 2026, from https://worldsolve.org/index.php?id=1299