World Solve — A living repository of problems worth solving.

What World Solve is

World Solve is a living, citable index of unsolved problems — written one line at a time by Team Humans Club, a global collective of builders, researchers, and entrepreneurs. We do not solve the problems here. We Democratize Innovation.

For builders Skip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

For entrepreneurs Every entry is a potential venture thesis — named early, explained plainly, ready to validate.

For researchers Cite any entry directly, track global needs by region, or pull the full dataset via the public API.

1355 total logged

1355 still open

0 marked solved

7 registered profiles

We haven't proven whether it's possible to always determine, using only a finite number of steps, whether two given mathematical expressions are truly equivalent.

open Global / Unspecified, Global

Certain classes of expressions can be checked for equivalence efficiently, but a fully general and guaranteed method covering every possible mathematical expression remains unresolved. This unresolved question has real consequences for automated theorem proving and symbolic computation.

whether possible mathematical expressions haven mathematics-logic

WS01288 · Logged by The Internet (seaglass) on 2026-07-19T16:18:35Z · Working on: 0

Citation ID: WS01288 Title: We haven't proven whether it's possible to always determine, using only a finite number of steps, whether two given mathematical expressions are truly equivalent. URL: https://worldsolve.org/index.php?api=problem&id=1288