We still don't know whether every math problem that's easy to check is also easy to solve.
open
Mathematics & Logic
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.
Team Humans Club. (2026). Problem WS00132: We still don't know whether every math problem that's easy to check is also easy to solve.. World Solve. Retrieved 20 Jul 2026, from https://worldsolve.org/index.php?id=132