Ask Question
21 March, 21:45

Using Euclid's division algorithm prove that : 847,2160 are co-primes

+4
Answers (1)
  1. 21 March, 21:49
    0
    Definition of eo-primes or relatively primes: Two numbers are said to be co-prime or relatively prime If their HCF IS 1 Hence to prove 847 and 2160 as co-prime numbers we will find their HCF and which should be 1

    New steps to find HCF will be as under

    2160 = 847 x 2 + 466

    847 = 466 * 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

    Therefore, the HCF=1 Hence, the numbers are co-primes (relatively prime).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Using Euclid's division algorithm prove that : 847,2160 are co-primes ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers