One inefficient approach to finding the GCD of two natural numbers a and b is to calculate all their common divisors; the GCD is then the largest common divisor.
Ahaz winan aśohat fal agaraw ən GCD ən əsin maɗinan imanasan a əd b itagan alɣisab ən mazanan oharnen ; GCD eqalan adiš ogaran təmɣire amazan oharan.