Question

Find the hcf of 847 and 2160 by euclid's division algorithm

Answer 1

Heya!

Here is yr answer.....

HCF of 847 & 2160 by EUCLID'S DIVISION ALGORITHM....

According to Euclid's postulate...

a = bq + r

a = divident - 2160

b = divisor - 847

q = quotient - ?

r = remainder - ?

2160 = 847 × 2 + 466

847 = 466 × 1 + 381

466 = 381 × 1 + 85

381 = 85 × 4 + 41

85 = 41 × 2 + 3

41 = 3 × 13 + 2

3 = 2 × 1 + 1

2 = 1 × 2 + 0


here, r = 0 ....so HCF = 1

Therefore, 847 and 2160 are co-primes...


Hope it hlpz..

Answer 2

Euclid Division Lemma
a= bq +r where 0≤r<b
2160 =847×2+466
847=466×1+381
466=381×1+85
381=85×4+41
85=41×2+3
41=3×13+2
3=2×1+1
2=1×2+0
as 1 is the HCF of 847 and 2160