Question

use the Euclid division algorithm to find whether the pair of the numbers 847 and 2160 at the co prime or not

Answer 1

As 2160 847

Let a= 2160 and b= 847

∴according to Euclid's division algorithm a= bq+r for some positive integers q r,0 ≤ r

using prime factorization method

2160 =847 x 2+366

847= 366 x 2 +115

366 = 115 x 2+36

115= 36 x 3+ 7

36 = 7 x 5+ 1

7 = 1 x 7+0

∴ HCF =1

Answer 2

I hope this will be helpful please make it brainliest
thank u (@_@)