Use Euclid’s division algorithm to find the HCF of: i. 135 and 225

Question

Harshit Singh · Answer

Dear Student

135 and 225
As you can see, from the question 225 is greater than 135.
Therefore, byEuclid’s division algorithm, wehave,

225 = 135 × 1 + 90
Now, remainder 90 ≠ 0,
thus again using division lemma for 90, we get,

135 = 90 × 1 + 45
Again, 45 ≠0,
repeating the above step for 45, we get,

90 = 45 × 2 + 0
The remainder is now zero, so our method stops here.
Since, in the last step, the divisor is 45,
therefore, HCF (225,135) = HCF (135, 90) = HCF (90, 45) = 45.
Hence, the HCF of 225 and 135 is 45.

Thanks

Thank you for registering.

Register Now and Win Upto 25% Scholorship for a Full Academic Year !

Enter Your Details

Registration done!

Use Euclid’s division algorithm to find the HCF of: i. 135 and 225

Use Euclid’s division algorithm to find the HCF of: i. 135 and 225

1 Answers

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

Other Related Questions on 10 grade maths

ASK QUESTION

Answer and earn gift vouchers

View courses by askIITians

Design classes One-on-One in your own way with Top IITians/Medical Professionals

Complete Self Study Package designed by Industry Leading Experts

Live 1-1 coding classes to unleash the Creator in your Child

a Complete All-in-One Study package Fully Loaded inside a Tablet!

Register Now & Win Upto 25% Scholorship