Question

Amita tries to find the highest common
factor of a and busing Euclid's division
algorithm (EDA).
In one of her steps, she divides 225 by
135
Find the highest common factor of a and
b.
HCF(a,b)​

Answer 1

Answer:

HCF(a,b)=45

Step-by-step explanation:

First we apply EDA on 225 and 135

225=135+90

135=90+45

90=45*2+0

Thus HCF(a,b)=45