The Euclidean Algorithm

Factoring huge numbers is brutal. But Euclid found a way to find the greatest common divisor of any two numbers without factoring either — just divide, keep the remainder, and repeat. It's one of the oldest algorithms on Earth, and computers still run it because it's blazingly fast, even on numbers thousands of digits long.