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 still haven't proven whether every finite list of numbers can always be rearranged into a sequence where every partial sum avoids a specific forbidden value.

open Global / Unspecified, Global

Combinatorial arrangement problems like this remain surprisingly resistant to full general solutions despite their simple appearance. This connects recreational mathematics with deeper unresolved questions in combinatorics.

every haven proven whether finite mathematics-logic

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

Citation ID: WS01309 Title: We still haven't proven whether every finite list of numbers can always be rearranged into a sequence where every partial sum avoids a specific forbidden value. URL: https://www.worldsolve.org/index.php?api=problem&id=1309