The P versus NP problem asks whether solutions whose answers can be easily verified are always easy to solve to begin with. We'll find out how to ask this question formally, and discuss what makes this problem so hard. We'll look at some of the problem's history, its present, and what may lie ahead for P and NP.