Fermat's last theorem probably doesn't. While attempts to solve it have led to many mathematical discoveries, the theorem itself feels little more than a piece of trivia. I'm less familiar with the implications of the Goldbach conjecture.
In contrast, class NP and NP-completeness quickly became central concepts in theoretical computer science.
In contrast, class NP and NP-completeness quickly became central concepts in theoretical computer science.