World Solve

Postpartum depression affects many new parents, often going undiagnosed until it significantly affects their wellbeing and their child's early development. Better early prediction could allow support to begin before symptoms take hold.

Personalized medicine is improving, but doctors still can't always predict in advance which patients will respond to a given treatment. Solving this could avoid painful trial-and-error treatment periods for patients.

A severe solar storm could knock out satellites, GPS, and even electrical grids with little warning. Better prediction would give critical infrastructure time to prepare or shut down safely.

Earth's magnetic field protects us from solar radiation, but the dynamo process that generates it deep underground is still only partly understood. This matters for predicting how long that protection will last.

We understand the general physics of dying stars, but the precise trigger moment inside a collapsing star remains difficult to observe and model. Solving this would sharpen predictions about stellar life cycles across the universe.

This conjecture about the zeros of a specific complex function would, if proven, tighten our understanding of how primes are distributed among all integers. It's considered one of the most important unsolved problems in mathematics.

Many Diophantine equations, which ask for whole-number solutions, resist any general method for predicting how many solutions exist. Solving specific cases has taken decades and earned major mathematical prizes.

Some sequences and structures appear chaotic without ever settling into repetition, and proving whether repetition is truly avoidable in specific systems remains unresolved. This connects deeply to dynamical systems and number theory.

Primes appear scattered with no obvious repeating pattern, and finding a true predictive formula, rather than just an approximation, remains unsolved. This is closely tied to the deeper mysteries of the Riemann Hypothesis.

True randomness is difficult to define and even harder to prove, since any formula-based sequence is, by definition, predictable if you know the formula. This unresolved tension underlies debates in both mathematics and philosophy of probability.

While specific solutions exist for certain rectangles, a full general theory predicting exactly which rectangles allow this kind of tiling remains incomplete. This puzzle blends recreational mathematics with serious combinatorics.

Irrational numbers have infinite, non-repeating digits, and while we can calculate them to enormous precision, no simple predictive pattern for their exact sequence has been found. This touches on deep unresolved questions in number theory.

Despite extensive computation, no proof confirms whether these digits behave truly randomly forever or eventually reveal some hidden structure. This remains an open question bridging number theory and statistics.

This is the famous Halting Problem, proven impossible to solve in full generality, yet many partial and practical questions around predicting program behavior remain actively studied. This shapes the theoretical limits of what computers can ever determine about themselves.

Related conjectures about how primes combine remain only partially proven for specific ranges, without a fully general confirmed pattern. This connects to broader unresolved questions about the additive structure of prime numbers.

Chaotic systems are famously sensitive to initial conditions, and whether their long-term patterns can ever be fully captured by simpler predictive rules remains an unresolved question in dynamical systems theory. This has real implications for weather prediction and other complex natural systems.

Partition numbers grow in a complex, only partially understood way, and while excellent approximations exist, a complete exact predictive formula for all cases remains elusive. This continues to be an active area within combinatorics and number theory.

Graph theory offers many partial answers about guaranteed patterns within large networks, but a fully general and complete theory covering every possible network structure remains incomplete. This affects our understanding of everything from social networks to biological systems.

Some cellular automata, like simple grid-based rule systems, produce behavior so complex that no shortcut prediction method has been proven to exist beyond simply running the simulation. This unresolved question touches on computational irreducibility and the philosophy of prediction.

The Prime Number Theorem offers an excellent approximation, but the finer details of exactly how actual prime counts deviate from this smooth prediction remain tied to the still-unproven Riemann Hypothesis. Fully resolving this would refine one of number theory's most central results.