Question

use evulids division algorithm to find the hcf of 900and 270​

Answer 1

Answer:

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

Answer 2

Answer:

HCF(900,270)=90

Step-by-step explanation:

Euclid's division lemma :

Let a and b be any two positive  integers .Then there exists two  unique whole numbers q and r  such that

a = bq + r ,

0 ≤ r < b

Now ,

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

hope it helps u

plz plz plz

plz plz

plz

plz plz

plz plz plz

please mark as brainliest