I'm trying to do the P vs NP problem, but I don't necessarily understand it. Would anyone mind explaining it a bit more?
I believe that a P vs NP problem is one where it's easy to see that an answer is wrong, but hard to find the right answer.
According to Wikipedia, "The question is whether or not, for all problems for which an algorithm can verify a given solution quickly (that is, in polynomial time), an algorithm can also find that solution quickly. Since the former describes the class of problems termed NP, while the latter describes P, the question is equivalent to asking whether all problems in NP are also in P. This is generally considered one of the most important open questions in mathematics and theoretical computer science as it has far-reaching consequences to other problems in mathematics, and to biology, philosophy and cryptography (see P versus NP problem proof consequences). A common example of an NP problem not known to be in P is the Boolean satisfiability problem."
Hmm, I'm not sure I understand it fully, but I hope you get it. :))))
Please tell me when you do.