Question

Using Euclid’s division algorithm, find which of the following
pairs of numbers are co-prime:
(i) 231, 396 (ii) 847, 2160

Answer 1

@satellite73

Answer 2

you know how to use it?

Answer 3

Dividend = Divisor * quotient + Remainder

or a = bq + r

Divide 396 by 231

396 = 231 * 1 + 156

Again divide 231 by 156 (as Remainder = 156 and not equal to zero)

231 = 156 * 1 + 75

.
.
.

Do it unless u get remainder = 0

Answer 4

Thanks

Answer 5

165 not 156

Answer 6

Pardon :( @Zarkon , thanks for pointing it out.

Answer 7

@goformit100 , do the process from start then!

Answer 8

ok

Answer 9

ok sure Sir

Answer 10

If divisor is 1, then they are co prime , if divisor is not 1 , then they are not coprime.

[Notice the divisor when remainder becomes zero]

Answer 11

ya