Question

Finding HCF through Euclid's division algorithm

You might need:Calculator

Problem

Amita tries to find the highest common factor of aaa and bbb using Euclid's division algorithm (\text{EDA})(EDA)left parenthesis, start text, E, D, A, end text, right parenthesis.

In one of her steps, she divides 225225225 by 135135135.

Find the highest common factor of aaa and bbb.

\text{HCF}(a,b)=HCF(a,b)=start text, H, C, F, end text, left parenthesis, a, comma, b, right parenthesis, equals ​

Answer 1

Answer:

123456789 there are 9 digits