The most difficult math problem in the world: NP complete problem, such as NP problem, is simply that if you let others put the pieces together in a complete cup, the solution of this problem is random and difficult to solve, but the result is a complete cup, so you can easily verify it, while the P-type problem is that if you let others count how many pieces are in the cup, it is relatively easy to solve, and the process of verification is the process of solving.
The complete problem of np is well known, so many mathematicians have not solved the question whether NP belongs to P, because if NP equals P, then many problems in this world are meaningless to think about, because knowing the answer means that they have been solved, so everyone is almost Einstein, and many scientific problems can be solved by any ordinary person.
So NP is not equal to P? There will be another paradox, that is, when I just choose the right one in the solution of NP polynomial, that is, the one similar to P, then NP equals P, then this is also untenable. Then the relationship between NP and P becomes extremely difficult to determine, which is also a difficult problem in the computer field.
Another simple metaphor is that when you want to find a banquet host from many participants, you need to look at them one by one. When others tell you the specific scope, you can see the banquet host at a glance. This is a NP problem. Just like the top ten unsolvable math problems, so far, no one can solve the most difficult math problem in the world.