Math, asked by angryprash93, 11 months ago

Use Euclid's Division algorithm to find the HCF of: (i) 1320 and 935 (ii) 1624 and 1276 (ii) 126l and 442
(iv) 576 and 252 (v) 729 and 1512
(vi) 2304 and 3136​

Answers

Answered by lovepatidar
4

Answer:

use Euclid division algorithm to find hcf 1320. and 935. and second is same hcf find 1624 and 1276 and thrid same hcf of between 1261 and 442 and same forth,fiveth,and sixth are all answer is same in questions

Answered by Anonymous
29

By using Euclid's Division algorithm, we get

i. 1320 and 935

Answer:

1320 = 935 × 1 + 385

935 = 385 × 2 + 165

385 = 165 × 2 + 55

165 = 55 × 3 + 0

Hence, the HCF of 1320 and 935 is 55.

ii. 1624 and 1276

Answer:

1624 = 1276 × 1 + 348

1276 = 348 × 3 + 232

348 = 232 × 1 + 116

232 = 116 × 2 + 0

Hence, the HCF of 1624 and 1276 is 116.

iii. 1261 and 442

Answer:

1261 = 442 × 2 + 377

442 = 377 × 1 + 65

377 = 65 × 5 + 52

65 = 52 × 1 + 13

52 = 13 × 4 + 0

Hence, the HCF of 1261 and 442 is 13.

iv. 576 and 252

Answer:

576 = 252 × 2 + 72

252 = 72 × 3 + 36

72 = 36 × 2 + 0

Hence, the HCF of 576 and 252 is 36.

v. 1512 and 729

1512 = 729 × 2 + 54

729 = 54 × 13 + 27

54 = 27 × 2 + 0

Hence, the HCF of 1512 and 729 is 27.

vi. 2304 and 3136

Answer:

3136 = 2304 × 1 + 832

2304 = 832 × 2 + 640

832 = 640 × 1 + 192

640 = 192 × 3 + 64

192 = 64 × 3 + 0

Hence, the HCF of 3136 and 2304 is 64.

Similar questions