This is one of the biggest unsolved problems in all of mathematics and computer science. Can you solve it?

KEY FACTS:

1. In a P problem, the number of steps is bounded by a polynomial based on the input size.

2. An unanswered question in math and computer science is whether or not P = NP.

3. An NP-complete problem means that is an efficient solution is found, there is an efficient solution to every other NP problem—but it only works if N=NP.

Watch video of the problem below:

Learn more »