We still don't know whether every math problem that's easy to check is also easy to solve.
open
Global / Unspecified, Global
WS00132
Known as the P versus NP problem, this asks whether problems whose solutions are easy to verify are also easy to find in the first place. Answering it would reshape computer science, cryptography, and optimization overnight.