formula of Euclid algorithm?
Attachments:

Answers
Answered by
0
Answer:
What is the formula for Euclidean algorithm? Explanation: The formula for computing GCD of two numbers using Euclidean algorithm is given as GCD (m,n)= GCD (n, m mod n). It is used recursively until zero is obtained as a remainder
Step-by-step explanation:
Hope it will help full for you
Similar questions
Political Science,
2 months ago
Social Sciences,
2 months ago
English,
2 months ago
Math,
3 months ago
Hindi,
3 months ago
English,
11 months ago
Math,
11 months ago