Beaty's Algorithm

Beaty's Algorithm is a method used in mathematics to find the greatest common divisor (GCD) of two numbers—meaning the largest number that divides both without leaving a remainder. It works by repeatedly dividing the larger number by the smaller and then replacing the larger with the smaller, while the smaller becomes the remainder. This process continues until the remainder is zero. The last non-zero divisor is the GCD. It’s similar to repeatedly subtracting the smaller number from the larger until only the common divisor remains, making calculations more efficient than simple trial division.