Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa
  • Home
  • School
  • Is 847 ,2160 are co prime prove with Euclid's division algorithm

Is 847 ,2160 are co prime prove with Euclid's division algorithm

Answers (1)

B Euclid's division algorithm

2160 = 847 x 2 + 466

847 = 466 x 1 + 381

466 = 381 x 1 + 85

381 = 85 x 4 + 41

85 = 41 x 2 + 3

41 = 3 x 13 + 2

3 = 2 x 1 + 1

2 = 1 x 2 + 0

H.C.F. of 847 and 2160 is 1 hence they are co-prime.

Posted by

Ravindra Pindel

View full answer

Similar Questions

Latest Question