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

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


(i) 340 and 412

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

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

No comments:

Post a Comment