There’s a very old math algorithm called Euclid’s Algorithm that lets you slowly work your way down to the greatest common factor between two numbers regardless of size. It’s quite simple but requires a lot of subtraction.