Question

use Euclid's algorithm to find the HCF of 900&270​

Answer 1

Answer:

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

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:

270)900(3

810

90)270(3

270

0

EUCLID'S DIVISION LEMMA:

a=bq+r

900=(270×3)+90;

Remainder is not equal to 0.

270=(90×3)+0;

Remainder is equal to 0.

Therefore,the HCF of 900 and 270 is 90.

HOPE IT HELPS YOU......