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](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhhfnFVpqP0W9z2ssBXXlNPLbT3rrArC3fGTpI6cFRLF8MoUYINiy203M1AypaAsXLi18I7Y35Ie5jE4LT24WrwW0hVBl5IFJm8kY0OqhnOTIn-UInTh0Ut2yyxkPI31qOOtRlXfrwNAD8/s1600-rw/Screenshot+2019-09-18+at+7.15.32+PM.png) |
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](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj0HUyuWltI3bqt-T_8jkdfbECuZcUneitU5GtjdpKryxAiumuKCEcBxKhf3iOqQ44mdD-9vShnqFkDYZUUFwXGG1tLxnvmJvMateq9sPOpSObDskvT35BnkaKbUO04f4mdTHH1r-GZs94/s1600-rw/Screenshot+2019-09-18+at+7.15.45+PM.png) |
Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of 340 and 412 |