Question

Use Euclid's division algorithm to find the HCF of 900 and 270

Answer 1

Hi ,

*******************************************
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

I hope this helps you.

: )

Answer 2

Heya !!!




As we know that,




270) 900 ( 3

*******810

___________
******90)270( 3

***********270

______________
Remainder = 0



Dividend = Divisor × Quotient + Remainder





900 = 270 × 3 + 90


270 = 90 × 3 + 0




Hence,


HCF of 900 and 270 is 90 .



HOPE IT WILL HELP YOU...... :-)