Question

using Euclid division algorithm find whether the pair of number 847, 2160 are coprime or not

Answer 1

$2160 = 847 \times 2 + 466 \\ 847 = 466 \times 1 + 381 \\ 466 = 381 \times 1 + 85 \\ 381 = 85 \times 4 + 41$
$85 = 41 \times 2 + 3 \\ 41 = 3 \times 13 + 2 \\ 3 = 2 \times 1 + 1 \\ 2 = 1 \times 2 + 0$
co-prime numbers have highest comman factor 1,from Euclid division algorithm we find that HCF(2160,847) =1
Thus numbers are co-prime.

Answer 2

Hi Friend,

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 216.  847 and 2160 are the co-primes.

Hope it helps you!

Step-by-step explanation: