Question

using Euclid's division algorithm, find whether the pair of numbers 847,​

Answer 1

Answer:

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

Answer 2

Answer:

847 = 466 * 1 + 381

Here remainder not equal to 0. Therefore Apply division to 466 and 381

466 = 381 * 1 + 85

Here remainder not equal to 0. Therefore Apply division to 381 and 85

85=41*2+3

we dont remainder as 0

41=3*13+2

we dont get remainder as 0 so we continue

3=2*1+1

we dont get remainder as 0 so we continue

2=2*1+1

As 1 is the HCF of 847 and 216.  847 and 2160 are the co-primes