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 fully determine, using a finite number of steps, whether any given mathematical pattern will repeat forever or never repeat at all.

open Global / Unspecified, Global

Some sequences defy simple prediction of long-term periodicity, and a fully general and efficient method for determining this in every possible case remains unresolved. This connects number theory with computability theory.

whether repeat possible fully number mathematics-logic

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

Citation ID: WS01327 Title: We haven't proven whether it's possible to fully determine, using a finite number of steps, whether any given mathematical pattern will repeat forever or never repeat at all. URL: https://www.worldsolve.org/index.php?api=problem&id=1327