Question

how to find greatest common divisor by Euclid algorithm​

Answer 1

hi friend here is your answer

Euclidean algorithms (Basic and Extended) GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and multiply common factors. If we subtract smaller number from larger (we reduce larger number), GCD doesn't change.

hope helps mark as brainliest