Five Unsolved Conjectures That Shape Modern Mathematics

Introduction

Mathematics is not a finished building. It is a construction site where the most important rooms remain unbuilt, and in some cases, we are not even sure the blueprints are possible. The unsolved problems of mathematics are not footnotes. They are the load-bearing walls of entire disciplines, and their resolution would reshape fields from cryptography to fluid dynamics to the very foundations of computation.

What makes these conjectures fascinating is not their difficulty alone. It is that each one sits at a boundary where our current tools break down. They expose the edges of mathematical knowledge, the places where intuition, computation, and proof diverge. Here are five that I think about often, why they matter, and what it would mean if someone solved them tomorrow.

The Riemann Hypothesis

The Riemann zeta function $\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$ for complex s with real part greater than 1 extends analytically to the entire complex plane (with a pole at $s = 1$). It has trivial zeros at the negative even integers. The Riemann Hypothesis, proposed in 1859, states that all nontrivial zeros of the zeta function have real part equal to $\frac{1}{2}$. That is it. One line. And it has resisted proof for over 165 years.

Why should anyone outside pure mathematics care? Because the zeta function encodes the distribution of prime numbers. The Prime Number Theorem tells us that primes thin out logarithmically, but the Riemann Hypothesis gives us the error term. If true, it means the primes are distributed as regularly as they possibly can be. If false, there are wild, unpredictable fluctuations in where primes appear.

The implications cascade. Much of modern cryptography, RSA, Diffie-Hellman, elliptic curve cryptography, depends on the computational hardness of problems related to prime numbers. The Riemann Hypothesis does not break cryptography directly, but a proof (or disproof) would fundamentally change our understanding of the arithmetic landscape these systems rest on. Computational verification has confirmed that the first $10^{13}+$ nontrivial zeros lie on the critical line. But in mathematics, ten trillion examples prove nothing. A single counterexample would be enough.

P vs NP

The P vs NP problem asks a question that sounds almost too simple: if you can verify a solution to a problem quickly, can you also find a solution quickly? More precisely, is the class $P$ (problems solvable in polynomial time) equal to the class $NP$ (problems whose solutions are verifiable in polynomial time)?

Consider the traveling salesman problem. Given a set of cities and distances, find the shortest route visiting all cities. Verifying a proposed route is trivial: add up the distances and check. But finding the optimal route appears to require checking an exponential number of possibilities. If P = NP, there exists an efficient algorithm we have not found yet. If P does not equal NP, no such algorithm can exist.

Most computer scientists believe P does not equal NP. The intuition is that creation is harder than verification. But intuition is not proof, and after decades of effort, we cannot even prove that specific problems are not in P. The barrier techniques (relativization, natural proofs, algebrization) that have blocked progress suggest that entirely new mathematical tools are needed.

The Collatz Conjecture

Take any positive integer. If it is even, divide by 2. If it is odd, multiply by 3 and add 1. Repeat. The Collatz Conjecture states that no matter what number you start with, you will eventually reach 1. That is the entire statement. A child can understand the rule. No one can prove it.

The sequence for 27 illustrates why this is deceptive. Starting from 27, the sequence climbs to 9,232 before eventually descending to 1, taking 111 steps. The trajectory is erratic, showing no discernible pattern that would yield to standard proof techniques. Paul Erdos famously said that “mathematics is not yet ready for such problems.”

The difficulty is structural. There is no algebraic framework that connects the multiplication step (3n + 1) to the division step (n / 2) in a way that admits induction or any standard proof strategy. The conjecture has been computationally verified for all integers up to approximately $2.95 \times 10^{20}$. In 2019, Terence Tao proved a partial result: for “almost all” positive integers (in the sense of logarithmic density), the Collatz sequence eventually reaches a value below any fixed function that goes to infinity. This was a significant advance, but it falls short of proving the conjecture for all integers.

# Verify the Collatz conjecture for a range of integers

def collatz_sequence(n):
    """Generate the Collatz sequence starting from n."""
    seq = [n]
    while n != 1:
        n = n // 2 if n % 2 == 0 else 3 * n + 1
        seq.append(n)
    return seq

def verify_collatz(start, end):
    """Verify Collatz conjecture for all integers in [start, end]."""
    max_steps = 0
    max_n = start
    for n in range(start, end + 1):
        steps = 0
        current = n
        while current != 1:
            current = current // 2 if current % 2 == 0 else 3 * current + 1
            steps += 1
        if steps > max_steps:
            max_steps = steps
            max_n = n
    return max_n, max_steps

# Example: verify for 1 to 100,000

longest_n, longest_steps = verify_collatz(1, 100_000)
print(f"In range [1, 100000]:")
print(f"  Longest sequence: n = {longest_n} with {longest_steps} steps")
print(f"  Sequence for 27: {collatz_sequence(27)[:20]}... ({len(collatz_sequence(27))} steps)")

The computational evidence is overwhelming, but that is precisely what makes the Collatz Conjecture a lesson in the difference between evidence and proof. Billions of examples cannot replace a single rigorous argument.

The Birch and Swinnerton-Dyer Conjecture

An elliptic curve is a curve defined by an equation of the form $y^2 = x^3 + ax + b$. Despite their name, they have nothing to do with ellipses. They are central objects in number theory, and the fundamental question is: how many rational points (points with rational coordinates) does a given elliptic curve have?

Some elliptic curves have finitely many rational points. Others have infinitely many. The Birch and Swinnerton-Dyer Conjecture (BSD) asserts that the rank of the group of rational points on an elliptic curve is equal to the order of vanishing of its associated $L$-function at $s = 1$. In plainer terms, it connects the arithmetic of the curve (how many rational solutions exist) to the analytic behavior of a complex function built from the curve.

This is not abstract formalism. Elliptic curves are the backbone of elliptic curve cryptography, which secures most modern internet traffic. The BSD conjecture, if proven, would deepen our understanding of the very objects that protect digital communication. It was also instrumental in the proof of Fermat's Last Theorem: Andrew Wiles's proof fundamentally relied on the Taniyama-Shimura conjecture, which connects elliptic curves to modular forms, a cousin of the BSD framework.

Navier-Stokes Existence and Smoothness

The Navier-Stokes equations describe the motion of viscous fluids. They are partial differential equations that govern everything from blood flow in arteries to weather patterns to airflow over aircraft wings. The Millennium Prize problem asks: given smooth initial conditions in three dimensions, do solutions to the Navier-Stokes equations always exist, and do they remain smooth for all time?

The question is not whether the equations are useful. They are used every day in engineering, meteorology, and medicine. The question is whether the equations are mathematically well-behaved. Can the velocity of a fluid described by Navier-Stokes blow up to infinity in finite time? If it can, the equations are fundamentally incomplete as a description of fluid dynamics, and the simulations we run are, in some deep sense, unreliable.

For anyone who writes simulation code, this problem is personal. Every time you discretize a PDE and trust the output, you are making an implicit assumption that the continuous equations have well-behaved solutions. Navier-Stokes asks whether that assumption is justified.

The Landscape

Comparing the Five Conjectures

Why These Matter

I am a pre-med student who builds software systems. Why do I care about unsolved conjectures in pure mathematics? Because every system I build rests on assumptions that trace back to these questions.

The cryptographic protocols protecting medical data assume P does not equal NP. The fluid dynamics simulations I use for biomedical modeling assume Navier-Stokes solutions are well-behaved. The number-theoretic primitives in my encryption libraries depend on the distribution of primes that the Riemann Hypothesis describes. These are not abstract questions. They are the hidden foundations of applied work.

And beyond the practical, there is something deeply compelling about problems that resist the best minds for centuries. The Collatz Conjecture is a reminder that simplicity of statement implies nothing about simplicity of proof. P vs NP asks whether the universe has a fundamental asymmetry between finding and checking. The Riemann Hypothesis suggests that the primes, the atoms of arithmetic, are governed by a hidden harmony we can detect but cannot yet prove.