# Hcf of 135 and 225 using euclids division algorithm

2
by varshaesther

2014-12-28T23:34:37+05:30

### This Is a Certified Answer

Certified answers contain reliable, trustworthy information vouched for by a hand-picked team of experts. Brainly has millions of high quality answers, all of them carefully moderated by our most trusted community members, but certified answers are the finest of the finest.
225 = 1×135 + 90
135 = 1×90 + 45
90 = 2×45 + 0

So HCF is 45.
2014-12-29T01:21:10+05:30

### This Is a Certified Answer

Certified answers contain reliable, trustworthy information vouched for by a hand-picked team of experts. Brainly has millions of high quality answers, all of them carefully moderated by our most trusted community members, but certified answers are the finest of the finest.
Express the bigger number in terms of small number as  quotient and reminder.  if the reminder is zero, then the divisor is the HCF.

225 = 135 * 1 + 90,            now    135 become dividend and 90 becomes divisor

135 = 90 * 1 + 45

90 = 45 * 2  + 0

as the reminder is zero,  the last divisor, 45 is the HCF.
If reminder is never zero, and is finally equal to 1, then    there is no HCF other than 1.