Question

find the HCF of 2160 and 847 using Euclid's division algorithm​

Answer 1

Answer:

Step-by-step explanation:

a=2160,b=847

By Euclid's lemma

a=bq+r,  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

∴ 847 and 2160 are co-primes as they have only 1 as their HCF.

mark it the best