Define the complexity classes P and NP in theoretical computer science. Explain the core question of whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. Discuss the theoretical consequences for cryptography, optimization, and mathematics if P were equal to NP or if P were not equal to NP.