If you haven't had a theory of computation class,
I'm not going to explain this now, but I hope some of you have had it
and will be able to answer the next quiz,
which is if it's proven that factoring is NP-hard,
what would it mean?
