Question

Using Euclid’s division algorithm, find whether the pair of numbers 847, 2160
are co-primes or not.

Answer 1

= > 2160 > 847.

(1 )

2160 = 847 * 2 + 466

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

(2)

847 = 466 * 1 + 381

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

(3)

466 = 381 * 1 + 85

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


(4)

85 = 41 * 2 + 3

Here remainder is not equal to 0.Therefore Apply division to 41 and 3.


(5)

41 = 3 * 13 + 2

Here remainder is not equal to 0. Therefore Apply division to 3 and 2.


(6)

3 = 2 * 1 + 1.

Here remainder is not equal to 0.Therefore Apply division to 3 and 2.

(7)

2 = 1 * 2 + 0.

Therefore the HCF of 847,2160 = 1.


Therefore the numbers are co-primes.


Hope this helps!

Answer 2

Answer:

'' Yes, the H.C.F OF (847,2160) IS CO-PRIME NUMBER''

Step-by-step explanation:

By using EUCLID division LEMMA

' find H.C.F OF 2160 and 847'

=》Since ,2160>847

so, let a=2160 ,b= 847

STEP 1: 2160 = 847×2+466

STEP 2: 847 = 466×1+381

STEP 3: 466 = 381×1+85

STEP 4: 381= 85×4+41

STEP 5: 85=41×2+3

STEP 6: 41=3×13+2

STEP 7: 3=2×1+1

STEP 8: 2=1×2+0

SO,THE REMAINDER IS NOW BECOME' 0'

AND THE HCFOF(2160,847) which is 1.

1 is a co-prime number

❤THANK YOU ❤