Question

Use Euclid's division Algorithm to find the HCF of : (1) 135 And 225

Answer 1

Given integers are 225 and 135.

225 > 135

(1) 225 = 135 * 1 + 90.

Here, the remainder is not equal to. Apply division on 135 and 90.

(2) 135 = 90 * 1 + 45.

Here, the remainder is not equal to 0. Apply division on 90 and 45.

(3) 90 = 45 * 2 + 0.

Here, the remainder is 0.


Therefore HCF of 135 and 225 = 45.


Hope this helps!

Answer 2

Heya !!!
.

.

.

★ HOPE IT WILL HELP YOU ★