EUCLID'S DIVISION LEMA

Using Euclid’s division algorithm,

96 = 56 x 1 + 40

56 = 40 x 1 + 16

40 = 16 x 2 + 8

16 = 8 x 2 + 0

HCF of 56 and 96 is 8.

Now to find HCF of 56, 96 and 404 we apply Euclid’s Division Algorthm to 404 and 8 i.e.

404 = 8 x 50 + 4

8 = 4 x 2 + 0

HCF (56, 96, 404) = 4