The Millennium Prize Problems Explained Simply

In the year 2000 the Clay Mathematics Institute offered USD 1 million each for solutions to seven of the hardest open problems in mathematics. More than two decades later, only one has been solved, and its solver famously turned the money down. This guide explains each problem in plain language, with small worked examples so you can feel what the questions are really about.

How the Prize Began

On 24 May 2000, at a meeting at the Collège de France in Paris, the Clay Mathematics Institute (founded by businessman Landon Clay) announced the Millennium Prize Problems. The event deliberately echoed David Hilbert's famous lecture in Paris in 1900, where he listed 23 problems that shaped twentieth-century mathematics.

The rules are strict: a solution must be published in a respected journal and survive at least two years of scrutiny by the mathematical community before the prize is considered.

The seven problems are:

1. P versus NP
2. The Riemann Hypothesis
3. The Poincaré Conjecture (solved)
4. The Hodge Conjecture
5. Yang–Mills Existence and Mass Gap
6. Navier–Stokes Existence and Smoothness
7. The Birch and Swinnerton-Dyer Conjecture

1. P versus NP

This is a question about computers. Some problems are easy to check but seem very hard to solve. P is the class of problems a computer can solve quickly (in time that grows like a polynomial in the input size). NP is the class of problems where a proposed answer can be checked quickly. The question is whether \( \text{P} = \text{NP} \): is every quickly checkable problem also quickly solvable?

Worked Example 1: Why brute force fails

Problem: You have 60 numbers and want to know whether some subset adds up to exactly 1,000,000 (the "subset-sum" problem). Checking one proposed subset takes a few additions. How long would trying every subset take?

Step 1. Each number is either in or out of the subset, so the number of subsets is

$$ 2^{60} = 1{,}152{,}921{,}504{,}606{,}846{,}976 \approx 1.15 \times 10^{18} $$

Step 2. Suppose a computer checks \( 10^9 \) subsets per second:

$$ \frac{1.15 \times 10^{18}}{10^{9}} = 1.15 \times 10^{9} \text{ seconds} $$

Step 3. Convert to years using \( 1 \text{ year} \approx 3.156 \times 10^{7} \) s:

$$ \frac{1.15 \times 10^{9}}{3.156 \times 10^{7}} \approx 36.5 \text{ years} $$

Step 4 (interpret). Adding just ten more numbers multiplies the time by \( 2^{10} = 1024 \), making it over 37,000 years. Yet if someone hands you the right subset, you can verify it in a fraction of a second. If P = NP, a clever fast method would exist; most experts believe it does not. The answer matters hugely, because internet security assumes some problems are hard to solve but easy to check.

2. The Riemann Hypothesis

Posed by Bernhard Riemann in 1859, this asks whether all the non-trivial zeros of the zeta function \( \zeta(s) = \sum_{n=1}^{\infty} n^{-s} \) lie on the line where the real part of \( s \) equals \( \tfrac{1}{2} \). It sounds abstract, but it controls how evenly the prime numbers are spread out. Over \( 10^{13} \) zeros have been checked by computer, and all lie on the line, but checking is not proof.

3. The Poincaré Conjecture (Solved)

Henri Poincaré asked in 1904: if a three-dimensional shape is closed (finite, without edges) and every loop drawn in it can be shrunk to a point, must it be a 3-sphere? The two-dimensional version is easy to picture: a loop on a ball can always shrink to a point, but a loop around a doughnut's hole cannot.

The Russian mathematician Grigori Perelman posted a proof online in 2002–2003, building on Richard Hamilton's "Ricci flow", a method that smooths out a shape the way heat spreads. After years of checking, the Clay Institute awarded him the prize in 2010. Perelman declined it, as he had earlier declined the Fields Medal in 2006, saying Hamilton's contribution was no less than his own.

4. The Hodge Conjecture

This lives in algebraic geometry. Mathematicians study complicated shapes by building them from simpler pieces. The conjecture says that, for a certain important class of shapes (projective algebraic varieties), particular topological features called Hodge classes can always be built from pieces defined by polynomial equations. In simple terms: geometry described by equations captures all of the relevant shape information.

5. Yang–Mills Existence and Mass Gap

Physicists describe the strong nuclear force using Yang–Mills theory (developed by Chen-Ning Yang and Robert Mills in 1954). Experiments and computer simulations show that the particles involved have a minimum positive mass, called the "mass gap". The problem asks for a rigorous mathematical construction of the quantum theory in four-dimensional space-time and a proof that the mass gap exists. Physics works with it daily; mathematics cannot yet justify it.

6. Navier–Stokes Existence and Smoothness

The Navier–Stokes equations, from the 1820s–1840s work of Claude-Louis Navier and George Stokes, describe how fluids such as water and air move. Engineers use them to design aircraft, pipelines and weather models. Yet nobody has proved that, in three dimensions, smooth starting conditions always produce smooth solutions forever. Perhaps the velocity could become infinite at some point in finite time (a "blow-up"). The prize goes to anyone who proves smoothness always holds, or finds an example where it fails.

7. The Birch and Swinnerton-Dyer Conjecture

This concerns elliptic curves, equations like \( y^2 = x^3 + ax + b \). The question is how many rational-number solutions such a curve has. In the 1960s Bryan Birch and Peter Swinnerton-Dyer used an early computer at Cambridge to count solutions modulo many primes \( p \), and noticed a pattern linking those counts to the number of rational solutions.

Worked Example 2: Counting points modulo 5

Problem: Count the solutions of \( y^2 \equiv x^3 - x \pmod{5} \).

Step 1. Compute \( x^3 - x \bmod 5 \) for each \( x \):

• \( x = 0 \): \( 0 \)
• \( x = 1 \): \( 0 \)
• \( x = 2 \): \( 8 - 2 = 6 \equiv 1 \)
• \( x = 3 \): \( 27 - 3 = 24 \equiv 4 \)
• \( x = 4 \): \( 64 - 4 = 60 \equiv 0 \)

Step 2. List the squares modulo 5: \( 0^2 = 0,\ 1^2 = 1,\ 2^2 = 4,\ 3^2 = 9 \equiv 4,\ 4^2 = 16 \equiv 1 \).

Step 3. Match each value:

• Value 0 (for \( x = 0, 1, 4 \)): only \( y = 0 \), giving 3 points.
• Value 1 (for \( x = 2 \)): \( y = 1 \) or \( 4 \), giving 2 points.
• Value 4 (for \( x = 3 \)): \( y = 2 \) or \( 3 \), giving 2 points.

Step 4. Total \( 3 + 2 + 2 = 7 \) points, plus one "point at infinity" that every elliptic curve has, giving 8. Birch and Swinnerton-Dyer computed counts like this for many primes and found that when the counts tend to run high, the curve tends to have infinitely many rational points.

Did You Know?

• Perelman's proof was posted on the free preprint server arXiv rather than in a journal, an unusual route for such a major result.
• The Riemann Hypothesis is the only problem on both Hilbert's 1900 list and the Clay 2000 list.
• Each Millennium problem has an official description written by a leading expert, published on the Clay Institute's website and in a 2006 book.

Key Takeaways

• The Clay Mathematics Institute announced seven Millennium Prize Problems in Paris on 24 May 2000, each worth USD 1 million.
• Only the Poincaré Conjecture has been solved, by Grigori Perelman, who declined the prize in 2010.
• P vs NP asks whether every problem that is easy to check is also easy to solve, with huge consequences for computing and security.
• Several problems (Navier–Stokes, Yang–Mills) arise directly from physics and engineering.
• The remaining problems connect number theory, geometry and physics, and any solution would reshape mathematics.

Curious about advanced maths or need help with a challenging assignment? Amathify's experts and PhD scholars offer step-by-step solutions, reach us on WhatsApp or through the Ask a Question form.