P versus NP is the name of a question that many mathematicians, scientists, and computer programmers want to answer. P and NP are two groups of mathematical problems. P problems are considered "easy" for computers to solve. NP problems are easy for a computer to check, though not necessarily easy to solve. For example, if you have an NP problem, and someone says "The answer to your problem is 1 2 3 4 5," a computer can quickly figure out if the answer is right or wrong, but it may take a very long time for the computer to come up with "1 2 3 4 5" on its own. In a lot of ways, NP problems ar...