Use Euclid's division algorithm to find whether the pair of numbers 847 and 2160 are coprime or not.
Answers
Answered by
6
Heya Friend ✋✋✋
if 847 and 2160 is a co prime .... we will not get a HCF.... if we get it is not co prime
2160 = 847 × 2 + 466
847 = 466 × 1 + 381
466 = 381 × 1 + 85
381 = 85 × 4 + 41
85 = 41 × 2 + 3
41 = 3 × 13 + 2
3 = 2 × 1 + 1
2 = 1 × 2 + 0
It has HCF as only 1 .... we know that co primes have only 1 as common
so it is coprimes
if 847 and 2160 is a co prime .... we will not get a HCF.... if we get it is not co prime
2160 = 847 × 2 + 466
847 = 466 × 1 + 381
466 = 381 × 1 + 85
381 = 85 × 4 + 41
85 = 41 × 2 + 3
41 = 3 × 13 + 2
3 = 2 × 1 + 1
2 = 1 × 2 + 0
It has HCF as only 1 .... we know that co primes have only 1 as common
so it is coprimes
Similar questions
History,
7 months ago
Hindi,
7 months ago
Chemistry,
1 year ago
Social Sciences,
1 year ago
Math,
1 year ago