Using Euclid's division Algorithm find HCF of (1) 455 and 42 (ii) 650 and 1170 (iii) 24, 36 and 40 (iv) 120, 224 and 256
Answers
Answered by
3
Answer:
Since, the last non-zero remainder that is obtained in the process is 7, this means that the HCF of 455 and 42 is 7. Hence, option (a) is the correct answer.
(b) .
Answer: HCF of 650 and 1170 is 130.
(c).Answer: HCF of 24, 36, and 40 is 4.
(d). Hence HCF of 120 and 224 =8.
Now HCF of 8 and 256= here 8<256. so. 256=8×32+0.
Hence HCF of 8 and 256 = 8. Hope my ans help you.
Answered by
0
Answer:
all rights
Step-by-step explanation:
Similar questions