In the world of theoretical computer science, P vs. NP is something of a unicorn. It's become notorious since it remains an unsolved problem. It basically asks this: If it is easy to check that a solution to a problem is correct, is it also easy to solve that problem? Get back to us when you have an answer.

## Why Is This So Hard?

## Who Wants to Be a Millionaire — From Math?

## Watch and Learn: Our Favorite Content About Unsolved Problems

#### Why Is P vs. NP Important?

Written by
Joanie Faletto
March 7, 2017

# Wake up with the smartest email in your inbox.

Our Best Articles Daily