Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of (ii) 867 and 255

SSLC 10TH STANDARD Tamil Nadu NEW SYLLABUS. 2019 - 2020.

CHAPTER 2: NUMBERS AND SEQUENCES

Exercise: 2.1

Question 6 :

Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of


(ii) 867 and 255


Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of   (ii) 867 and 255

Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of 867 and 255


No comments:

Post a Comment