Prove This Math Equation to Hack The Entire Digital world !
In mathematics, there are several complexity classes for the problems. If you can solve a problem in polynomial time (we can predict the maximum amount of time it will take to solve the problem), such problem will be called ‘ P-class ‘ problem. But, if you are not sure about the solution in polynomial time, such problem will be called ‘ NP-class ‘ problem. P class is the set of problems that can be solved in polynomial time. NP is the set of problems whose solutions can not be determined but can be verified in polynomial time. Here, the first two paragraphs are about NP-class problems. Ok, I know that you are reading this article to know about that magical equation which, once proved, can break all the existing security protocols of the internet. In fact, the Clay Institute is offering one million dollars for a solution to the problem. So let’s talk about the equation which I considered you might be interested in. Is P=NP? Yes, tw...