Q&A - Ask Doubts and Get Answers

Clear All
867 > 225. Applying Euclid's Division algorithm we get since remainder  0 we apply the algorithm again. since 255 > 102 since remainder  0 we apply the algorithm again. since 102 > 51 since remainder = 0 we conclude the HCF of  867 and 255 is 51.
38220 > 196. Applying Euclid's Division algorithm we get since remainder = 0 we conclude the HCF of  38220 and 196 is 196.
225 > 135. Applying Euclid's Division algorithm we get since remainder  0 we again apply the algorithm since remainder  0 we again apply the algorithm since remainder = 0 we conclude the HCF of 135 and 225 is 45.
Exams
Articles
Questions