Learn to Create a Robotic Device Using Arduino in the Free Webinar. Register Now
One of our academic counsellors will contact you within 1 working day.
Click to Chat
1800-1023-196
+91-120-4616500
CART 0
Use Coupon: CART20 and get 20% off on all online Study Material
Welcome User
OR
LOGIN
Complete Your Registration (Step 2 of 2 )
Free webinar on Robotics (Block Chain) Learn to create a Robotic Device Using Arduino
30th Jan @ 5:00PM for Grade 1 to 10
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
Dear Student135 and 225As you can see, from the question 225 is greater than 135.Therefore, byEuclid’s division algorithm, wehave,225 = 135 × 1 + 90Now, remainder 90 ≠ 0,thus again using division lemma for 90, we get,135 = 90 × 1 + 45Again, 45 ≠0,repeating the above step for 45, we get,90 = 45 × 2 + 0The 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
Post Question
Dear , Preparing for entrance exams? Register yourself for the free demo class from askiitians.
points won -