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 (ii) 867 and 255](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjXxE9klO48E4132JHgmQW_4kehdRjpQKw2CrgOcCGwkYSpLhmqSqLM6fe4XEoDAhA2iB8anXcJXA5aDWBI3vUAM9mytQ5mhQVGJ8IlfbVqA1m7Zz4N2Qi30G3VSouMvFnmMWjh7nElps4/s1600-rw/Screenshot+2019-09-18+at+7.15.56+PM.png) |
Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of 867 and 255
|