Question

Find euclid division algorithm to find Hcf of 135 and 225

Answer 1

Answer:

Euclid's Division Lemma = a = bq + r

Here, a represents the number with higher value, b represents a positive integer, q is the quotient and r is the remainder.

But while finding the HCF of two numbers, we generally take a as the highest value and the final value of 'b' we get after getting r = 0 is called as the HCF of the two numbers.

Applying the steps we get,

=> 225 = 135 × 1 + 90

=> 135 = 90 × 1 + 45

=> 90 = 45 × 2 + 0

Since r = 0, the value of b is our HCF.

Value of b = 45.

Hence 45 is the HCF of 135 and 225.

Answer 2

answer :)


by using Euclid Division algorithm :

a = bq + r


when be divide 225 from 135 we got 1 as quotient and 90 as remainder.

then,

according to Euclid division algorithm.

225 = 135 × 1 + 90


Here , remainder is not zero then again do this process by dividing 135 by 90.

we got 1 as quotient and 45 as remainder . according to Euclid,s division algorithm .

135 = 90 × 1 + 45


here remainder again not zero then we do this process by dividing 90 by 45.

we got 2as quotient and 0 as remainder .

then,

90 = 45 × 2 + 0


hence , b = 45 and r = 0

here , remainder = 0

so , Hcf of 225 and 135 is 45.


be brainly.