One of the deepest questions in computer science is called P vs. NP, and answering the question would earn you a million-dollar prize. P vs. NP is one of the Clay Mathematics Institute Millennium Prize Problems, seven problems judged to be among the most important open questions in mathematics.

P vs. NP is about finding algorithms, or computer programs, to solve particular math problems, and whether or not "good" algorithms exist to solve these problems. Good algorithms allow a computer to come up with a solution to a problem relatively quickly, even if the size of the input to the problem is very large. Problems for which computer scientists have found good algorithms are said to be in the "complexity class" P.



Read more: http://www.businessinsider.com/p-vs-np-millennium-prize-problems-2014-9#ixzz3CMju2iaU

Link ~> http://www.businessinsider.com/p-vs-np-millennium-prize-problems-2014-9

P vs NP?
Peter vs No Paul (p-square) = Lola omotayo wahala
Note: J is a constant. i.e Jude


Now my $1m

.