Seven mathematical problems with a US$1 million prize for each solution
This article is about the math prizes. For the technology prize, see Millennium Technology Prize.
Millennium Prize Problems
Birch and Swinnerton-Dyer conjecture
Hodge conjecture
Navier–Stokes existence and smoothness
P versus NP problem
Poincaré conjecture (solved)
Riemann hypothesis
Yang–Mills existence and mass gap
v
t
e
The Millennium Prize Problems are seven well-known complex mathematical problems selected by the Clay Mathematics Institute in 2000. The Clay Institute has pledged a US$1 million prize for the first correct solution to each problem.
The Clay Mathematics Institute officially designated the title Millennium Problem for the seven unsolved mathematical problems, the Birch and Swinnerton-Dyer conjecture, Hodge conjecture, Navier–Stokes existence and smoothness, P versus NP problem, Riemann hypothesis, Yang–Mills existence and mass gap, and the Poincaré conjecture at the Millennium Meeting held on May 24, 2000. Thus, on the official website of the Clay Mathematics Institute, these seven problems are officially called the Millennium Problems.
To date, the only Millennium Prize problem to have been solved is the Poincaré conjecture. The Clay Institute awarded the monetary prize to Russian mathematician Grigori Perelman in 2010. However, he declined the award as it was not also offered to Richard S. Hamilton, upon whose work Perelman built.
and 18 Related for: Millennium Prize Problems information
The MillenniumPrizeProblems are seven well-known complex mathematical problems selected by the Clay Mathematics Institute in 2000. The Clay Institute...
institute is best known for establishing the MillenniumPrizeProblems on May 24, 2000. These seven problems are considered by CMI to be "important classic...
is one of the seven MillenniumPrizeProblems selected by the Clay Mathematics Institute, each of which carries a US$1,000,000 prize for the first correct...
what computers can and cannot do. The P versus NP problem, one of the seven MillenniumPrizeProblems, is part of the field of computational complexity...
NP-complete problems. This NP-completeness theorem, often called the Cook–Levin theorem, was a basis for one of the seven MillenniumPrizeProblems declared...
computational problems and what can be computed efficiently. Yet, the conjecture remains open and is among the seven famous MillenniumPrizeProblems. In 1982...
unsolved problems; it is also one of the Clay Mathematics Institute MillenniumPrizeProblems. The P versus NP problem is a major unsolved problem in computer...
theory and its extensions such as stack theory. One of seven MillenniumPrizeproblems, the Hodge conjecture, is a question in algebraic geometry. Algebraic...
the problems (depending how some are interpreted) have been solved. A new list of seven important problems, titled the "MillenniumPrizeProblems", was...
eighth problem in David Hilbert's list of twenty-three unsolved problems; it is also one of the Clay Mathematics Institute's MillenniumPrizeProblems, which...
structure from its sequence. Lists of unsolved problems (by major field) Hilbert's problemsMillenniumPrizeProblems Faltings, Gerd (July 1995), "The Proof of...
The Millennium Technology Prize (Finnish: Millennium-teknologiapalkinto) is one of the world's largest technology prizes. It is awarded once every two...
solutions to the Navier–Stokes equations, named as one of the MillenniumPrizeProblems in 2000. Partial differential equations are ubiquitous in mathematically...
sides of a standard six-sided dice always add to 7. The MillenniumPrizeProblems are seven problems in mathematics that were stated by the Clay Mathematics...
Global Information