What If N Equals One

You know you're in a real Computer Science class when the professor casually drops "P = NP ?" on the board and the entire room goes silent. That's literally one of the seven Millennium Prize Problems worth a million bucks if you solve it. It's the question that keeps theoretical computer scientists up at night—can every problem whose solution can be quickly verified also be quickly solved?

Students frantically scribbling notes thinking they're about to witness history, when really the prof is probably just setting up context for why your sorting algorithm homework matters. Nothing like accidentally walking into a lecture that makes you question whether you're smart enough to be there. Meanwhile, half the class is wondering if this will be on the exam while the other half is already having an existential crisis about computational complexity theory.