World Solve

These equations describe everything from heat flow to fluid movement, but many types still lack a general, reliable solving method. Progress here would ripple into physics, engineering, and climate modeling.

Some mathematical series behave predictably, while others sit in ambiguous territory where convergence is difficult to prove definitively. Fully resolving these cases remains an active area of mathematical research.

Turbulent flow, like water rushing through a pipe or air moving over a wing, is notoriously hard to describe with exact mathematics. A complete theory would improve everything from weather prediction to aircraft design.

We have very good approximations, but no exact formula exists that perfectly predicts the count of primes below a chosen number. Improving this approximation remains an active and important area of research.

This idea, part of an old and famous conjecture, has held true in every case checked so far but has never been proven true for all numbers without exception.

Finding the shortest possible route visiting a long list of locations becomes exponentially harder as the list grows, and no fully efficient general solution exists. Logistics, chip design, and delivery networks all run into this limit.

Twin primes are pairs of prime numbers that differ by only two, and mathematicians strongly suspect there are infinitely many, but nobody has proven it. This remains one of number theory's oldest open questions.

If P equaled NP, countless hard problems in logistics, cryptography, and optimization could be solved efficiently, but most computer scientists suspect they can't. This remains the most famous open question in computer science.

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.

Gödel's incompleteness theorems already showed some truths escape any fixed formal system, but the full boundary between provable and unprovable truths remains an active area of exploration. This shapes how we understand the limits of formal reasoning itself.

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.

This weaker cousin of Goldbach's Conjecture illustrates how even modest-sounding claims about primes can remain unproven for centuries. It highlights how little we still understand about the raw arithmetic of prime numbers.

Mersenne primes, of the form two raised to a power minus one, are the largest primes ever discovered, but no one has proven that the list never ends. Finding new ones remains an active computational hunt.

If pi is what mathematicians call 'normal,' every string of digits, including your birthday or an entire book encoded in numbers, would appear infinitely often. No proof exists either way, despite pi's digits being computed to trillions of places.

This difficulty is exactly what keeps most modern encryption secure, since multiplying primes together is easy but reversing the process is not. If an efficient method were found, it could upend the security of the internet as we know it.

Sphere-packing problems are solved for a few specific dimensions, but the general pattern across all possible dimensions remains unknown. This affects fields ranging from error-correcting codes to theoretical physics.

Despite chess being fully deterministic with no hidden information, its complexity is so vast that no one has proven who truly holds the advantage under perfect play. Solving smaller games has offered clues, but full chess remains unresolved.

Mathematicians have many tools for distinguishing knots, but no single method works perfectly and efficiently for every possible case. This unsolved problem sits at the heart of the mathematical field of knot theory.

Starting from any positive number and repeatedly applying a basic rule always seems to eventually reach the number one, but no proof confirms this holds for every possible starting point. Its simplicity contrasted with its difficulty has made it famous among mathematicians and hobbyists alike.

Certain simple-sounding tiling and packing puzzles remain surprisingly resistant to a complete general solution. These problems test the limits of combinatorics and geometric reasoning.