Question

Find HCF of 568 and 432 by euclids division algorithm

Answer 1

Answer: 2

Step-by-step explanation:

Answer 2

Answer:

8

Step-by-step explanation:

According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of the Euclidean division algorithm is Euclid's division lemma.

568 =   432  x   1   +   136

432 =   136   x   3  +    24

136 =    24    x   5  +     16

24  =     16     x    1    +   8

16   =      8     x    2

Therefore HCF of 568 and 432 = 8