Question

use euclids division algorithm to find the H.C.F of 1. 135 and 225

Answer 1

HEY YOUR ANSWER IS .....


BY EUCLID'S DIVISION ALGORITHM WE GET ,

As 225 > 135 ,

So ,

225 = 135 × 1 + 90

As remainder is not 0 so ,

135 = 90 × 1 + 45

As remainder is not 0 so ,

90 = 45 × 2 + 0

So , remainder = 0 .


So , HCF = 45