The Euclidean algorithm is a mathematical formula for efficiently determining the greatest common divisor between two integers. It is great for simplifying fractions. Yep, I can see your eyes glassing over already. If you really want to know more about this algorithm other than my code snippet, just read the about Euclid’s algorithm on Wikipedia.
