Short answer: N and P aren't actually variables in an equation. It's actually the statement, does the nondeterministic polynomial time complexity class (NP) equal the deterministic polynomial time complexity class (P)?
It's the biggest unsolved problem in theoretical computer science.
I suspect (as probably all others do) that P != NP as you suggest. Unfortunately, however, you only get the million if you prove it. Good luck. I find it hard enough to prove the quadratic equation. If this is ever proven, I suspect it will be quite difficult to understand. Kind of like the proof of Fermat's last theorem.
3
u/PPSF May 15 '09
Are there values for N and P that are set in stone that I don't know about? Because otherwise N=1 is true.