find gcd using Euclid's method algorithm 216 101
Answers
Answered by
0
HCF of 216, 101 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 216, 101 is 1.
HCF(216, 101) = 1
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
Similar questions