Question

The HCF of 900 and 270 eulid's algorithms in maths

Answer 1

Step-by-step explanation:

ANSWER :

HCF of 900 and 270 ,

start with the larger

integer , that is 900.

Apply the Division lemma , we get

900=270×3+90

270=90×3+0

The remainder has now become

zero . Now our procedure stops.

Since the divisor at this stage is 90.

Therefore ,

HCF(900,270)=90