Question

using Euclid's division algorithm, find the HCF of 236 and 422.

Answer 1

Hey buddy !!

Here is yr answer
______________________________

According to Euclid's division algorithm

a=bq+r

422 = 236 × 1 + 186

236 = 186 × 1 + 50

186 = 50 × 3 + 36

50 = 36 × 1 + 14

36 = 14 × 2 + 8

14 = 8 × 1 + 6

8 = 6 × 1 + 2

6 = 2 × 3 + 0

According to Euclid's division algorithm..... when the remainder becomes 0, then the divisor is the HCF

Therefore, HCF of 422 and 236 = 2

Hope it hlpz....

Answer 2

422 > 236

(1)

422 = 236 * 1 + 186

The remainder is not equal to 0. Use division algorithm for 236 and 186.


(2)

236 = 186 * 1 + 50

The remainder is not equal to 0.Use division algorithm for 186 and 50.

(3)

186 = 50 * 3 + 36

The remainder is not equal to 0. use division algorithm for 50 and 36.


(4)

50 = 36 * 1 + 14

The remainder is not equal to 0. use division algorithm for 36 and 14.


(5) 36 = 14 * 2 + 8

The remainder is not equal to 0. use division algorithm for 14 and 8.


(6) 14 = 8 * 1 + 6

The remainder is not equal to 0. use division algorithm for 8 and 6.


(7) 8 = 6 * 1 + 2

The remainder is not equal to 0. Use division algorithm for 6 and 2.


(8) 6 = 2 * 3 + 0.

The remainder is 0.



Therefore the HCF of 236 and 422 = 2.


Hope this helps!