Question

find gcd by euclid algorithm 89 and 14​

Answer 1

Answer:

14, 89

Step-by-step explanation:

• HCF of 14, 89 by Euclid's Divison lemma method can be determined easily by using our free online HCF using Euclid's Divison Lemma Calculator and get the result in a fraction of seconds ie., 1 the largest factor that exactly divides the numbers with r=0.
• Highest common factor (HCF) of 14, 89 is 1.
• HCF(14, 89) = 1
• Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345

Answer 2

Answer:

Euclid's Algorithm = Dividend = Divisor × Quotient + Remainder

89 = 14 × 6 + 5

14 = 5 × 2 + 4

5 = 4 × 1 + 1

4 = 1 × 4 + 0

So, 1 is the greatest common factor or gcd of 89 and 14

PLEASE MARK ME BRAINLIEST

Step-by-step explanation: