# Is there a shortcut to the world?

At the beginning of 2000, the American Clay Institute of Mathematics selected seven “Millennium Awards”: NP Complete Problem, Hodge Conjecture, Poincaré Conjecture, Riemann Conjecture, Yang-Mills Existence and Quality Gap, Weil-Stoke equation and BSD conjecture. The NP complete problem is the first in this list of mathematical problems, the biggest problem in computer science, and perhaps the most difficult of all math problems. P complete problem is P = NP? The problem was first raised by Stephen Cook in 1971. It is the youngest of the seven Millennium Awards and the best one.
What is P and NP?
In our lives, some math problems can be solved quickly, such as buying things to checkout; but some math problems take a lot of time to solve, such as playing chess. With the development of mathematics and computer science, people have come up with better algorithms for some of the more difficult mathematical problems, so the time required to solve them becomes less. If the problem is divided into two types: quick resolution and slow resolution, adding, subtracting, multiplying and dividing is a problem that can be solved quickly. Chess is a slow problem. Of course, there are still many problems. We don’t know where to divide them. one type. So we used a more precise definition of P and NP to classify these mathematical problems.